| Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|
| 42204 | YOYOLEE-李昕颖 | 选猴王 | C++ | Wrong Answer | 1 MS | 256 KB | 492 | 2024-02-24 12:11:57 |
#include<bits/stdc++.h> using namespace std; int main() { int n,m,a[100],num; bool flag=0; while(cin>>n>>m&&n&&m){ int j=0,k=n; memset(a,1,sizeof(a)); while(1){ int i=1; for(i=1;i<=n;i++){ if(a[i]){ j++; if(j%m==0){ a[i]=0; j=0;k--; if(k==1){ flag=1; num=i; break; } } } } if(k==1) break; } if(flag){ cout<<num<<endl; flag=0; continue; } } return 0; }