USACO 2.3 Cow Pedigrees (DP动态规划)

最新推荐文章于 2024-10-01 18:52:56 发布

tiutiu2011

最新推荐文章于 2024-10-01 18:52:56 发布

阅读量257

点赞数

分类专栏： Talk is cheap Show me the code ACM-ICPC 文章标签： USACO 2.3 Cow Pedigrees DP 动态规划

本文链接：https://blog.csdn.net/tiutiu2011/article/details/48859039

版权

Talk is cheap Show me the code 同时被 2 个专栏收录

168 篇文章 0 订阅

订阅专栏

ACM-ICPC

154 篇文章 0 订阅

订阅专栏

#include <stdio.h>
#define DEBUG 1
#define TESTCASES 9

int main(){
#if DEBUG
	int testCase;
	for (testCase = 1; testCase <= TESTCASES; testCase++){
		char inputFileName[20] = "inputX.txt";
		inputFileName[5] = '1' +  (testCase - 1);
		freopen(inputFileName, "r", stdin);
		printf("\n#%d\n", testCase);
#endif

	int totalNodes, theHight;
	scanf("%d%d", &totalNodes, &theHight);

	int trees[100][200];
	int hight, nodes;
	for (hight = 0; hight <= theHight; hight++)
		for (nodes = 0; nodes <= totalNodes; nodes++)
			trees[hight][nodes] = 0;

	for (hight = 1; hight <= theHight; hight++)
		for (nodes = 1; nodes <= totalNodes; nodes += 2){
			if (nodes == 1){
				trees[hight][nodes] = 1;
				continue;
			}
			int theNodes;
			for (theNodes = 1; theNodes <= nodes - 2; theNodes += 2)
				trees[hight][nodes] = (trees[hight][nodes] + trees[hight - 1][theNodes] * trees[hight - 1][nodes - 1 - theNodes]) % 9901;	
		}

	printf("%d\n", (trees[theHight][totalNodes] - trees[theHight - 1][totalNodes] + 9901) % 9901);

#if DEBUG
	}
#endif
	return 0;
}