Run ID | Author | Problem | Lang | Verdict | Time | Memory | Code Length | Submit Time |
---|---|---|---|---|---|---|---|---|
42213 | 老方 | 选猴王 | C++ | Accepted | 1 MS | 244 KB | 352 | 2024-02-24 15:47:45 |
#include<bits/stdc++.h> using namespace std; int a[100],n,m,j=0,num; int main(){ bool flag=0; while(cin>>n>>m&&n!=0&&m!=0){ int j=0,k=n,i=0; memset(a,1,sizeof(a)); while(k>1){ if(a[i])j++; if(j==m){ a[i]=0; j=0; k--; } i++; i%=n; } for(int i=0;i<n;i++)if(a[i])cout<<i+1<<endl; } return 0; }