1090.cpp

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

/*  This Code is Submitted by wywcgs for Problem 1090 on 2005-10-27 at 21:54:26 */ 
#include <cstdio>

const int MAX = 512;

int main()
{
	long long c[MAX] = {0};
	int i, j, n;

	for(i = MAX-1; i > 0; i--) {
		c[i] = 1;
		for(j = MAX-1; j > 2 * i; j--) {
			if(i == (j-1) / 2) {
				c[j] = 1;
			}
			c[j] += c[j-i];
		}
	}
	while(scanf("%d", &n) == 1) {
		if(n == 0) {
			return 0;
		} else {
			printf("%lld\n", c[n]-1);
		}
	}
	
	return 0;
}