hdu 4472 Count(简单递推)
来源:互联网 发布:淘宝网首页布局介绍 编辑:程序博客网 时间:2024/05/01 20:34
Count
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2465 Accepted Submission(s): 1645
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
分析:简单递推
代码如下:
#include<iostream>#include<cstdio>#include<cstring>using namespace std;const int Mod=1e9+7;long long dp[1005];void init(){ dp[1]=1; dp[2]=1; dp[3]=2; for(int i=4;i<=1000;i++) { dp[i]=0; for(int j=1;j<=i;j++) { if((i-1)%j==0) { dp[i]+=dp[j]; dp[i]%=Mod; } } }}int main(){ int n; int inde=0; init(); while(~scanf("%d",&n)) { printf("Case %d: %lld\n",++inde,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 递推
- HDOJ 4472 Count(递推)
- HDU 4472 Count (线性dp 推公式)
- HDU4472 Count (递推)
- hdu 2045(简单递推)
- HDU-超级阶梯(简单递推)
- hdu 2046 简单递推
- HDU 2190 简单递推
- HDU 3336 Count the string(KMP+Next数组递推)
- UVa 1645 - Count(递推)
- HDU4472 Count(递推)
- hdu 4472 递推
- HDU - 2501 - Tiling_easy version (简单递推关系!!)
- 乘法逆元
- Lintcode移动零
- Unity 进度条
- Python中的random模块(总结)
- 微信小程序例子——获取自己所处的位置坐标
- hdu 4472 Count(简单递推)
- STL中的multimap---顺便说说如何查找同一关键字对应的所有值(利用count, lower_bound/upper_bound, equal_range)
- C++ 基础知识四
- Angular 4.x 学习导引
- pc 电脑web浏览器js通过usb控制安卓手机打电话挂电话
- Codeforces 315C Sereja and Contest【思维】
- MySQL 忘记密码:skip-grant-tables
- Java并发编程 10 线程池
- 关于实模式下汇编伪指令assume的个人理解