1441.cpp

来自「这是哈尔滨工业大学acmOJ的源代码」· C++ 代码 · 共 36 行

/*  This Code is Submitted by wywcgs for Problem 1441 on 2005-10-29 at 04:49:41 */ 
#include <cstdio>

const int MAX = 256;

int main()
{
	int n, m, i, p;
	bool can;

	while(scanf("%d", &n) == 1) {
		if(n == 0) {
			return 0;
		} else {
			for(m = 2; ; m++) {
				can = true;
				p = (m - 1) % (n - 1);
				for(i = 0; i < n-2; i++) {
					if(p == 0) {
						can = false;
						break;
					} else {
						p = (p + m - 1) % (n-2-i);
					}
				}
				if(can) {
					printf("%d\n", m);
					break;
				}
			}
		}
	}
	
	return 0;
}