Count
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 78 Accepted Submission(s): 52
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 10 9 +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 10 9 +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
1 2 3 40 50 600 700
Sample Output
Case 1: 1 Case 2: 1 Case 3: 2 Case 4: 924 Case 5: 1998 Case 6: 315478277 Case 7: 825219749这个题目就是每一层子树必须一样的树的个数,以开始做的是二维DP,也是0MS的代码,但是觉得内存好大,于是改进了一下,改成了一维的。具体思路是。首先树的根只能是一个节点,然后对于后面的子树,每次找到相应层可以分得组数,并进行记忆计数。下面上代码#include <iostream> #include <cstring> #include <cstdio> #include <cmath> using namespace std; const int mod=1000000007; int dp[1001]; int dfs(int n) { if (n==1||n==0) return 1; if (dp[n]==-1) { dp[n]=0; int tmp1; int tmp=sqrt(double(n)); int i; for (i=1;i<=tmp;i++) { if (n%i==0) { tmp1=n/i; dp[n]+=dfs(tmp1-1); dp[n]%=mod; dp[n]+=dfs(i-1); dp[n]%=mod; } } if (tmp*tmp==n) { dp[n]+=mod-dfs(tmp-1); dp[n]%=mod; } } return dp[n]; } int main() { memset(dp,-1,sizeof(dp)); int n,cas=1; while(scanf("%d",&n)!=EOF) { printf("Case %d: %d\n",cas++,dfs(n-1)); } return 0; }