| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 71886 | LJY | 19灯的编号 | C++ | Wrong Answer | 3 MS | 8076 KB | 421 | 2024-04-27 18:04:44 |
#include <iostream> using namespace std; int f[2000001]; int main() { int n, pos; cin >> n; double a[n]; int t[n]; for (int i=0; i<n; ++i) cin >> a[i] >> t[i]; for (int i=0; i<n; ++i) for (int j=1; j<=t[i]; ++j) { pos = int(j*a[i]); f[pos]=f[pos]?0:1; } for (pos=1;!f[pos];++pos); cout << pos << endl; return 0; }
------Input------
77 40
------Answer-----
1,4,9,16,25,36,41,42,43,44,45,46,47,48,50,51,52,53,54,55,56,57,58,59,60,61,62,63,65,66,67,68,69,70,71,72,73,74,75,76,77
------Your output-----
2000200