Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
37350 | zhouhuanyu 玙静 | 开关灯 | C++ | Accepted | 1 MS | 256 KB | 510 | 2024-01-20 11:44:10 |
#include <bits/stdc++.h> using namespace std; int d[5005]; int main(){ int n, m; cin >> n >> m; for(int i = 1; i <= n; i++) cin >> n >> m; for(int i = 1; i <= n; i++){ d[i] = 1; } for(int i = 1; i <= m; i++){ for(int j = 1; j <= n; j++){ if(j % i == 0){ d[j] = -d[j]; } } } int flag = 1; for(int i = 1; i <= n; i++){ if(d[i] == -1 && flag == 1){ cout << i; flag = 0; } else if(d[i]==-1 && flag == 0){ cout << "," << i ; } } return 0; }