HDU 4472 Count
来源:互联网 发布:定向数据流量 编辑:程序博客网 时间:2024/06/04 23:34
Count
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2462 Accepted Submission(s): 1642
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: 6216 6215 6214 6213 6212
My ugly code
#include <cstdio>#include <cmath>#include <algorithm>#include <cstring>#include <string>#define ll long longusing namespace std;const ll mod=1e9+7;ll dp[1010],n;int cas=1;void INIT(){ dp[1]=1; dp[2]=1; dp[3]=2; for(int i=4;i<=1000;i++){ for(int j=1;j<=i;j++){ if((i-1) % j == 0){ dp[i]+=dp[(i-1)/j]; dp[i]=dp[i]%mod; } } } }int main(){ INIT(); while(~scanf("%d",&n)) printf("Case %d: %lld\n",cas++,dp[n]); return 0;}
阅读全文
0 0
- HDU 4472 Count
- hdu 4472 count
- HDU 4472 Count
- HDU 4472 Count
- hdu 4472 Count
- hdu 4472 Count dp
- hdu 4472 Count
- HDU 4472 Count
- [dp] hdu 4472 Count
- hdu 4472 Count
- HDU 4472 Count
- HDU 4472 Count 递推
- HDU——4472 Count
- HDU-#4472 Count(DP)
- HDU 4472 - Count(计数DP)
- HDU ACM 4472 Count->DP
- hdu 4472 Count 动态规划
- hdu 4472 Count 递推
- javascript数组操作方法
- org.apache.catalina.LifecycleException: Failed to start component
- HDU 3361 ASCII
- delphi7 基础之一 小白你好
- 20.leetCode412: Fizz Buzz
- HDU 4472 Count
- Eclipse 常用设置
- se_lab3
- 【poj 1050】 To the Max 【Greater New York 2001】
- 富文本编辑器WangEditor,实现图片上传OSS云存储
- PBE实现加密算法
- Codeforces Round #354 (Div. 2) C
- Mac下发布Qt应用程序
- c++之STL之pair,map