| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 132460 | 6倪葭轩 | 19灯的编号 | Python3 | Accepted | 63 MS | 3784 KB | 280 | 2025-10-08 14:29:43 |
n, m = map(int, input().split()) lights = [True] * (n + 1) for k in range(1, m + 1): for i in range(k, n + 1, k): lights[i] = not lights[i] result = [] for i in range(1, n + 1): if not lights[i]: result.append(str(i)) print(','.join(result))