Uva133 约瑟夫圆环新解

之前学数据结构遇到双向循环列表，现在发现一种更简便的方法解决类似约瑟夫圆环问题。

 

#include<iostream>
using namespace std;
int n,k,m ,a[25];
int go(int p, int d, int t)
{
	while (t--){
		do{ p = (p + d +n - 1) % n + 1; } while (a[p] == 0); // 括号里面加上n,在顺时针-1的时候 不会出现负数的p
	}
	return p;
}

 int main()
{
	 while (scanf("%d%d%d", &n, &k, &m) == 3 && n)
	 {
		 for (int i = 1; i <= n; i++)a[i] = i;
		 int left = n;//剩余的人
		 int p1 = n, p2 = 1;
		 while (left)
		 {
			 p1 = go(p1, 1, k);
			 p2 = go(p2, -1, m);
			 cout <<  p1; left--;
			 if (p1 != p2) { cout <<" "<<p2; left--; }
			 a[p1] = a[p2] = 0;
			 if (left)
				 cout <<"," ;
		 }
		 cout << endl;
	 }
	system("pause");
	return 0;
}