| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 149815 | 左锶焜 | 19灯的编号 | C++ | Wrong Answer | 1 MS | 288 KB | 505 | 2026-03-17 19:25:22 |
#include<iostream> // cin\cout\endl #include<cstdio> //scanf()\printf() #include<cstring> // strcpy()\strcat()\strcmp()\strlen()\memset() #include<cmath> //sqrt()\pow()\abs()\ceil()\floor()\max()\min() using namespace std; int main(){ int a[5001]={},n,m; cin>>n>>m; for(int i=2;i<=n;i++){ for(int k=i;k<=m;k+=i){ a[k]=!a[k]; } } cout<<1; for(int i=2;i<=n;i++){ if(!a[i]) 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,4,9,16,25,36,41,42,43,44,45,46,47,48,49,50,51,52,53,54,55,56,57,58,59,60,61,62,63,64,65,66,67,68,69,70,71,72,73,74,75,76,77