| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 79569 | 王百琛 | 19灯的编号 | C++ | Wrong Answer | 1 MS | 272 KB | 335 | 2024-07-08 15:53:48 |
#include<iostream> #include<cmath> #include<iomanip> using namespace std; int main() { int n, m; cin >> n >> m; int a[n+1] = {0}; for (int j = 1; j <= m; j++) { for (int i = 1; i <= n; i++) { if (i % j == 0) { a[i]++; } } } for(int i=1;i<=n;i++){ if(a[i] % 2 == 1){ cout<<i<<" "; } } }
------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-----
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