| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 76693 | 彭慕允 | 猴子选大王 | C++ | Wrong Answer | 1 MS | 276 KB | 398 | 2024-06-02 16:38:02 |
#include<bits/stdc++.h> using namespace std; int main() { int n; int m; cin>>n>>m; int die[n+1]= {0}; 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) { die[ren]=1; bao = 0; sr++; } } } for(int i=1; i<n; i++) { if(die[i]!=0) { cout<<i; } } return 0; }
------Input------
226 188
------Answer-----
15
------Your output-----
12345678910111213141617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032