| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 124537 | 晏莞煜 | 19灯的编号 | C++ | Wrong Answer | 0 MS | 268 KB | 311 | 2025-07-11 16:55:06 |
#include<iostream> using namespace std; int main(){ int n,m; cin>>n>>m; int a[n+1]={0}; for(int i=1;i<=m;i++){ for(int j=1;j<=n;j++){ if(j%i==0){ a[j]=0; }else{ a[j]=1; } } } cout<<"1"; for(int i=2;i<=n;i++){ if(a[i]==1){ 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,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,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