hdu 4472 Count (递推)
来源:互联网 发布:韩佳人的鼻子 知乎 编辑:程序博客网 时间:2024/05/22 15:55
Count
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1756 Accepted Submission(s): 1133
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
对于每个合法图形,记最底层个数为j,则再增加一层增加的个数必须是j的倍数。可以用dp[i][j]表示i个点最底层为j个时的个数,对于数据范围内的N遍历得到答案。(属于“我为人人”型的递推关系)
dp[i][j]-->dp[i+j*k][j*k](k=1...N)
#include <iostream>#include<stdio.h>#include<string.h>#include<math.h>#include<algorithm>using namespace std;#define N 1010#define LL __int64const int mod=1000000007;int f[N][N],ans[N];void inti(){ int i,j,k; memset(f,0,sizeof(f)); f[1][1]=1; for(i=1;i<=1000;i++) { for(j=1;j<=1000;j++) { if(f[i][j]==0) //由当前合法状态推得其他状态 continue; for(k=1;k<=1000;k++) { int t1=j*k; int t2=t1+i; if(t2>1000) break; f[t2][t1]+=f[i][j]; if(f[t2][t1]>=mod) f[t2][t1]%=mod; } } } for(i=1;i<=1000;i++) { int tmp=0; for(j=1;j<=i;j++) tmp=(tmp+f[i][j])%mod; ans[i]=tmp; }}int main(){ int n,cnt=1; inti(); while(scanf("%d",&n)!=-1) { printf("Case %d: %d\n",cnt++,ans[n]); } return 0;}
0 0
- hdu 4472 Count (递推)
- HDU 4472 count(递推)
- hdu 4472 Count(简单递推)
- HDU 4472 Count 递推
- hdu 4472 Count 递推
- hdu 4472 Count DP 递推
- HDOJ 4472 Count(递推)
- HDU 4472 Count (线性dp 推公式)
- HDU4472 Count (递推)
- HDU 3336 Count the string(KMP+Next数组递推)
- UVa 1645 - Count(递推)
- HDU4472 Count(递推)
- hdu 4472 递推
- HDU-#4472 Count(DP)
- HDOJ 题目3485 Count 101(递推)
- hdu 2046(递推)
- HDU 5273(递推)
- hdu 5273(递推)
- 【原创】windows/Linux通过ssh服务远程登录centos6.5
- Spring事务属性
- oracle EBS數據移植工具FNDLOAD的用法整理
- 人和计算机的交互
- Android中使用ViewPager制作广告栏效果 - 解决ViewPager占满全屏页面适配问题
- hdu 4472 Count (递推)
- 简单编程(七)编程制作特殊图案 星星塔(1) for循环的嵌套编程
- Codeforces Round #275 (Div. 2)
- android UI开源项目
- Android调用camera错误setParameters failed深层解析
- javascript-解析xml文件-在html中实现二级联动分析及案例
- Altium Designer之一种可用于两块电路板接口定位的便捷实用方法
- ORA-600 [4000] 错误解决一例
- 模拟赛 狐狸的谜语(时间限制:1s,空间限制:128MB)