|
发表于 2022-10-5 18:43:54
|
显示全部楼层
本帖最后由 jhq999 于 2022-10-5 18:58 编辑
- int main(){
- int n,m,i,j;
- scanf("%d%d",&n,&m);
- int l[n+1];
- for(i=1;i<=n;i+=1)
- {
- if(i%2)l[i]=1;
- else l[i]=0;
- }
- for(i=3;i<=m;i+=1)
- {
- for(j=1;j*i<=n;j+=1)
- {
- l[j*i]=!l[j*i];
- }
- }
- for(i=1;i<=n;i+=1)if(l[i])printf("%4d",i);
- return 0;
- }
复制代码- 5000 5000
- 1 4 9 16 25 36 49 64 81 100 121 144 169 196 225 256 289 324 361 400 441 484 529 576 625 676 729 784 841 900 961 1024 1089 1156 1225 1296 1369 1444 1521 1600 1681 1764 1849 1936 2025 2116 2209 2304 2401 2500 2601 2704 2809 2916 3025 3136 3249 3364 3481 3600 3721 3844 3969 4096 4225 4356 4489 4624 4761 4900
- Process returned 0 (0x0) execution time : 6.460 s
- Press any key to continue.
复制代码 |
|