| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 76736 | 杨莹斌 | 环形密码 | C++ | Wrong Answer | 0 MS | 268 KB | 553 | 2024-06-02 17:02:32 |
#include<bits/stdc++.h> using namespace std; int main(){ int n,m; cin >> n >> m; int die[n + 1]={0}; int mina[n + 1]; for(int i = 1;i <= n;i++){ cin >> mina[i]; } int sr = 0; int ren = 0,bao = 0; while(sr != n-1){ ren++; if(ren > n){ ren = 1; } if(die[ren] == 0){ bao++; if(bao == m){ cout << mina[ren]<<" "; die[ren] = 1; bao = 0; sr++; m = mina[ren]; } } } for(int i = 1;i <= n;i++){ if(die[i] ==0){ cout << i; return 0; } } return 0; }
------Input------
10 3 8 3 6 3 4 10 3 10 3 2
------Answer-----
6 3 3 10 8 3 3 2 10 4
------Your output-----
6 3 3 10 8 3 3 2 10 5