| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 149838 | 李亭绪 | 19灯的编号 | C++ | Wrong Answer | 0 MS | 272 KB | 557 | 2026-03-18 19:04:20 |
#include<iostream> // cin\cout\endl #include<cstdio> //scanf()\printf() #include<cstring> // strcpy()\strcat()\strcmp()\strlen()\memset() #include<cmath> //sqrt()\pow()\abs()\ceil()\floor()\max()\min() using namespace std; int main(){ int n,m,a[101]={0}; cin>>n>>m; for(int i=1;i<=n;i++){ for(int j=1;j<=m;j++){ if(j%i==0){ a[j]=(!a[j]); } } } for(int i=1;i<n;i++){ if(a[i]==1){ cout<<i<<","; } cout<<i; } 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,1234,456789,910111213141516,16171819202122232425,252627282930313233343536,3637383940414243444546474849505152535455565758596061626364656667686970717273747576