Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
44109 | lnx | 开关灯 | C++ | Accepted | 1 MS | 244 KB | 441 | 2024-03-29 14:52:33 |
#include<iostream> using namespace std; int main() { int n,m; cin>>n>>m; int a[n+1]; for(int i=1;i<=n;i++) { a[i]=1; } for(int j=1;j<=m;j++) { for(int k=j;k<=n;k++) { if(k%j==0) a[k]++; } } int isFirst=1; for(int x=1;x<=n;x++) { if(a[x]%2==0) { if(isFirst==1) { cout<<x; isFirst=0; } else cout<<","<<x; } } // cout<<x<<":"<<a[x]<<","; return 0; }