1196.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1196 on 2006-01-10 at 01:26:22 */ 
#include <cstdio>

const int MAX = 128;
const int LAST = 13;

int main()
{
	int i, j, n, m[MAX];
	
	for(i = LAST; i < 100; i++) {
		for(m[i] = 1; ; m[i]++) {
			int p = 0;
			for(j = i-3; j >= 0; j--) p = (p+m[i]) % (i-j-1);
			if(p+2 == LAST) break;
		}
	}
	while(scanf("%d", &n) != EOF && n != 0) printf("%d\n", m[n]);
	
	return 0;
}