约瑟夫环问题

虽然很简单

#include<iostream>
using namespace std;

int circle[100];

void josefu(int m, int p)
{

	int count = 0;
	int step = 0;
	int call = 0;
	int j = 0;
	memset(circle, 0, 100);
	while (count < m)
	{

		call = 0;
		while (call < p)
		{
			j = (j + 1) % (m + 1);
			if (j == 0)
				j++;
			if (circle[j] == 0)
			{

				call++;
			}
		}

		circle[j] = 1;
		cout << j << " ";
		count++;
		

	}
}

int main()
{
	int m, p;
	cin >> m >> p;
	josefu(m, p);
	cout << endl;
	system("pause");
	return 0;

}