Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
---|---|---|---|---|---|---|---|---|
125137 | 唐诗阳 | 19灯的编号 | C++ | Wrong Answer | 1 MS | 292 KB | 451 | 2025-07-13 15:30:55 |
#include<iostream> #include<cstdio> //scanf()\printf() #include<cstring> #include<cmath> //sqrt()\pow()\abs()\ceil()\floor()\max()\min() using namespace std; int main(){ int a[5001]={0},N,M; cin>>N>>M; for(int i=2;i<=M;i++){ for(int j=i;j<=N;j++){ a[j]=!a[j]; } } cout<<1; for(int i=2;i<=N;i++){ if(a[i]==0){ cout<<','<<i; } } 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,3,5,7,9,11,13,15,17,19,21,23,25,27,29,31,33,35,37,39