| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 80965 | 赵文浚 | 19灯的编号 | C++ | Wrong Answer | 0 MS | 280 KB | 397 | 2024-07-11 17:13:25 |
#include <iostream> using namespace std; int arr[5001]; int main() { int n,m; cin>>n>>m; for(int i=1;i<=m;i++) { for (int j=1; j<=n; j++) { if (j%i==0) { if(arr[j]==0) { arr[j]=1; } else { arr[j]=0; } } } } cout<<1; for(int j=1;j<=n;j++) { if(arr[j]==1) { cout<<","<<j; } } 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-----
1,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