| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 77084 | 邓嘉懿 | 19灯的编号 | C++ | Wrong Answer | 0 MS | 284 KB | 366 | 2024-06-08 11:57:48 |
#include <bits/stdc++.h> using namespace std; int main () { int n,m; cin>>n>>m; int d[5001]= {0}; for(int i=1; i<=m; i++) { for(int j=1; j<=n; j++) { if(j%i==0) { d[j]++; } } } int f=0; for(int j=1;j<=m;j++){ if(d[j]%2==1&&f==0){ cout<<j; f=1; }else if(d[j]%2==1&&f!=0){ cout<<","<<j; } } 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,4,9,16,25,36