hdu4472(DP)
来源:互联网 发布:外贸口语书籍推荐,知乎 编辑:程序博客网 时间:2024/06/06 02:56
Count
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1063 Accepted Submission(s): 695
Problem Description
Prof. Tigris is the head of an archaeological team who is currently in charge of an excavation in a site of ancient relics.
This site contains relics of a village where civilization once flourished. One night, examining a writing record, you find some text meaningful to you. It reads as follows.
“Our village is of glory and harmony. Our relationships are constructed in such a way that everyone except the village headman has exactly one direct boss and nobody will be the boss of himself, the boss of boss of himself, etc. Everyone expect the headman is considered as his boss’s subordinate. We call it relationship configuration. The village headman is at level 0, his subordinates are at level 1, and his subordinates’ subordinates are at level 2, etc. Our relationship configuration is harmonious because all people at same level have the same number of subordinates. Therefore our relationship is …”
The record ends here. Prof. Tigris now wonder how many different harmonious relationship configurations can exist. He only cares about the holistic shape of configuration, so two configurations are considered identical if and only if there’s a bijection of n people that transforms one configuration into another one.
Please see the illustrations below for explanation when n = 2 and n = 4.
The result might be very large, so you should take module operation with modules 109 +7 before print your answer.
This site contains relics of a village where civilization once flourished. One night, examining a writing record, you find some text meaningful to you. It reads as follows.
“Our village is of glory and harmony. Our relationships are constructed in such a way that everyone except the village headman has exactly one direct boss and nobody will be the boss of himself, the boss of boss of himself, etc. Everyone expect the headman is considered as his boss’s subordinate. We call it relationship configuration. The village headman is at level 0, his subordinates are at level 1, and his subordinates’ subordinates are at level 2, etc. Our relationship configuration is harmonious because all people at same level have the same number of subordinates. Therefore our relationship is …”
The record ends here. Prof. Tigris now wonder how many different harmonious relationship configurations can exist. He only cares about the holistic shape of configuration, so two configurations are considered identical if and only if there’s a bijection of n people that transforms one configuration into another one.
Please see the illustrations below for explanation when n = 2 and n = 4.
The result might be very large, so you should take module operation with modules 109 +7 before print your answer.
Input
There are several test cases.
For each test case there is a single line containing only one integer n (1 ≤ n ≤ 1000).
Input is terminated by EOF.
For each test case there is a single line containing only one integer n (1 ≤ n ≤ 1000).
Input is terminated by EOF.
Output
For each test case, output one line “Case X: Y” where X is the test case number (starting from 1) and Y is the desired answer.
Sample Input
1234050600700
Sample Output
Case 1: 1Case 2: 1Case 3: 2Case 4: 924Case 5: 1998Case 6: 315478277Case 7: 825219749
Source
2012 Asia Chengdu Regional Contest
Recommend
liuyiding | We have carefully selected several similar problems for you: 4769 4767 4766 4765 4761
本题要求子树形状相同的树的个数。
对于拥有n个节点的树。我们可以枚举子树的个数。要是子树的形状相同,必须保证子树的节点数==(n-1)/i;其中i为子树的个数。这样可以用DP的思想求。
dp[n]=∑dp[i];其中(n-1)能整出i.
#include<iostream>#include<cstdio>using namespace std;int dp[1000+10];const int mod=1000000000+7;int func(int n){ int i; if(dp[n]) return dp[n]; else if(n==1) { return 1; } for(i=1;i<=n-1;i++) { if((n-1)%i==0) dp[n]+=func((n-1)/i); dp[n]=dp[n]%mod; } return dp[n];}int main(){ int n,i,tag=0; int ans; memset(dp,0,sizeof(dp)); while(~scanf("%d",&n)) { ans=func(n); printf("Case %d: %d\n",++tag,ans); } return 0;}
- HDU4472(DP)
- hdu4472(DP)
- hdu4472 Count(简单dp)
- hdu4472 Count dp
- HDU4472 Count DP
- hdu4472
- hdu4472
- hdu4472
- hdu4472 Count
- HDU4472 Count
- HDU4472 Count(递推)
- hdu4472 递推
- HDU4472 Count (递推)
- 2012 Asia Chengdu Regional Contest-hdu4472
- 2012ACM/ICPC成都赛区现场赛I题---Count(hdu4472)
- HDU4472-第37届ACM/ICPC成都现场赛I题
- dp
- dp
- hdu 3664 Permutation Counting(水DP)
- 大步小步攻击算法_完全版
- poj2462
- java保留两位小数4种方法
- Hadoop入门实践之构造模块
- hdu4472(DP)
- assertThat使用说明
- 第十周项目三——乘法口诀表
- POJ 计算几何入门题目推荐
- Oracle EBS SQL Trace日志收集的方法
- 雷军:没想到红米会如此火 芯片也应免费
- 循环的利用-------多个数的平均值【简单循环】
- POJ 1830 开关问题 (高斯消元)
- 第十周项目1-利用循环求和(while)