猴子选大王

//参考自算法竞赛

#include<cstdio>
#include<time.h>
#include<iostream>
#define maxn 200 
using namespace std;


int n=11,k=3,a[maxn] ;
int go(int p,int d,int t){
	while(t--){
		do{
			p=(p+d+n-1)%n+1;
		}while(a[p]==0);
	}
	return p;
}

int main(){
	for(int i=1;i<=n;i++)a[i]=i;   //编号
	int leave=n;
	int p=n;
	while(leave){
		p=go(p,1,3);
		printf("%3d",p);
		leave--;
		a[p]=0;
		if(leave)cout<<',';
	} 
	cout<<endl;
	cout<<"Time used:"<<(double)clock()/CLOCKS_PER_SEC<<'s';
	return 0;
}