list的用法---约瑟王问题

n个猴子围圈报数，报道m的猴子退出剩下的重新报数。

#include<cstdio>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#pragma warning(disable:4996)
using namespace std;
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<list>
#include<unordered_map>
#include<unordered_set>
const int maxn = 100 + 10;
const int INF = 0x7fffffff;
const double eps = 1e-6;
int main() {
	list<int> lis;
	int n, m;
	while (scanf("%d%d", &n, &m)) {
		if (n == 0 && m == 0)break;
		lis.clear();
		for (int i = 1; i <= n; i++)lis.push_back(i);
		list<int>::iterator it = lis.begin();
		while (lis.size() > 1) {
			for (int i = 1; i < m; i++) {//每次走m-1次
				++it;
				if (it == lis.end())
					it = lis.begin();//到头了就从头再来
			}				
			it = lis.erase(it);//已经走了m-1次了，这是第m次，所以要删除
			if (it == lis.end())
				it = lis.begin();//如果刚才删除的是最后一个元素，则it变成lis.end()
		}
		printf("%d\n", lis.front());
	}
}
/*
6 2
12 4
8 3
0 0

->
5
1
7

*/