Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
88999 | 王郡翊 | 19灯的编号 | C++ | Accepted | 1 MS | 272 KB | 324 | 2024-08-21 16:53:55 |
#include<iostream> 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]++; } } } cout<<1; for (int i = 2; i <= n; i++) { if (a[i] % 2 == 1) { cout<<"," << i; } } }