1277.cpp

来自「哈尔滨工业大学ACM 竞赛网上在线试题集锦的源代码」· C++ 代码 · 共 32 行

/*  This Code is Submitted by wywcgs for Problem 1277 on 2005-11-10 at 23:43:49 */ 
#include <cstdio>

const int MAX = 64;

int main()
{
	double e[MAX][MAX] = {0}, c[MAX] = {0};
	int i, j, n;
	
	for(i = 0; i < MAX; i++) {
		e[i][i] = 1;
	}
	for(i = 1; i < MAX; i++) {
		for(j = 1; j < i; j++) {
			e[i][j] += e[i-1][j]*j + e[i-1][j-1];
		}
	}
	for(i = 1; i < MAX; i++) {
		for(j = 1; j <= i; j++) {
			c[i] += e[i][j];
		}
	}
	while(scanf("%d", &n) == 1) {
		if(n == 0) {
			return 0;
		} else {
			printf("%d %.0lf\n", n, c[n]);
		}
	}
}