| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 156453 | 何兴驰 | 19灯的编号 | C++ | Wrong Answer | 1 MS | 272 KB | 361 | 2026-06-28 12:52:11 |
#include<bits/stdc++.h> 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%1==0){ if(a[j]==0){ a[j]=1; }else{ a[j]=0; } } } } bool f=1; for(int i=1;i<=n;i++){ if(a[i]=1){ cout<<i; f=0; }else{ cout<<","<<i; } } }
------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-----
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677