HDU4472 Count (递推)
来源:互联网 发布:java word svg 编辑:程序博客网 时间:2024/05/22 14:06
Count
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2468 Accepted Submission(s): 1646
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
题意:给n个顶点,组成一棵树,该树关于根节点对称。
思路:去掉根节点以后,则其他子树必然是完全一样的,则只需要判断根节点有几个直接子树即可,假设有i个节点,该节点有j个子树,则每个子树有(i-1) / j 个节点,则f[i] = f[i] + f[(i-1) / j];
#include <bits/stdc++.h>using namespace std;const int mod = 1e9 + 7;int f[1010],n,cas = 0;void init(){ memset(f,0,sizeof(f)); f[1] = f[2] = 1; for(int i = 3; i <= 1000; i ++){ for(int j = 1; j < i; j ++){ if((i - 1) % j == 0){ f[i] = (f[i] + f[(i - 1) / j]) % mod; } } }}int main(){ init(); while(~scanf("%d",&n)){ printf("Case %d: %d\n",++ cas, f[n]); } return 0;}
阅读全文
0 0
- HDU4472 Count (递推)
- HDU4472 Count(递推)
- hdu4472 递推
- hdu4472 Count
- HDU4472 Count
- hdu4472 Count(简单dp)
- hdu4472 Count dp
- HDU4472 Count DP
- HDOJ 4472 Count(递推)
- hdu 4472 Count (递推)
- UVa 1645 - Count(递推)
- HDU 4472 count(递推)
- hdu 4472 Count(简单递推)
- hdu4472
- hdu4472
- hdu4472
- HDU 4472 Count 递推
- hdu 4472 Count 递推
- Eclipse各版本分析比较
- Linux下编译Android ffmpeg库(mediacodec 硬件解码)
- LeetCode71 Simplify Path
- 稳定匹配算法python实现
- 运行 Unix网络编程 中的第一个例子 unp学习 实例的运行
- HDU4472 Count (递推)
- 25. Reverse Nodes in k-Group
- PCA的数学原理
- 中兴面试——数据统计分析师(西安)
- dlcf
- Win Server 2008 系统中的IIS下以Fastcgi形式配置Bottle或Flask开发的网站
- resuful api 简介
- 在opencv3中的机器学习算法
- VS2013+WDK8.1+VirtualBox驱动开发连接,弹出三次用户名和密码界面之后,连接失败