I think it's just a slot. Isn't it Joseph? I used a linked list to write my mind as soon as I smoked it, then it's t, and finally I used the Joseph problem simulated by vector.
#include <iostream>#include <cstdio>#include <cmath>#include <cstring>#include <queue>#include <iomanip>#include <algorithm>#include <vector>#define LL __int64using namespace std;int n,m;vector<int>p;int flag[55000];int main(){int cnt;int s;while(scanf("%d%d",&n,&m)!=EOF){s=2*n;p.clear();for(int i=1;i<=s;i++){p.push_back(i);flag[i]=0;}cnt=1;while(s>n){cnt+=m-1;if(cnt<=s){flag[p[cnt-1]]=1;p.erase(p.begin()+cnt-1);if(cnt==s){cnt=1;}}else{cnt%=s;if(cnt==0){cnt=s;}flag[p[cnt-1]]=1;p.erase(p.begin()+cnt-1);if(cnt==s){cnt=1;}}s--;}for(int i=1;i<=2*n;i++){if(flag[i]){cout<<"B";}else{cout<<"G";}if(i%50==0){cout<<endl;}}cout<<endl;cout<<endl;}return 0;}
HDU-4841 Round Table problem STL simulation Joseph Problem