2012ICPC长春站 I Count【暴力+模拟】
2017-10-04 14:10
441 查看
Font Size: ← →
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.
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.
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
Source
2012 Asia Chengdu Regional Contest
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.
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.
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
Source
2012 Asia Chengdu Regional Contest
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<iomanip> #include<string> #include<vector> #include<stack> #include<queue> #include<cmath> #include<functional> using namespace std; #define LL long long int #define INF 0x3f3f3f3f const int maxn = 1e4 + 10; const int MOD = 1e9 + 7; int n; int ans[maxn]; void solve() { memset(ans, 0, sizeof(ans)); ans[1] = 1; for (int i = 2; i <= 1000; i++) { for (int j = 1; j < i; j++) { if ((i - 1) % j == 0) ans[i] = (ans[i] + ans[j]) % MOD; } } } int main() { solve(); int k = 0; while (cin >> n) { k++; cout << "Case " << k << ": " << ans << endl; } return 0; }
相关文章推荐
- 2012-2013 ACM-ICPC, NEERC, Central Subregional Contest H Milestones1 (暴力)
- ACM/ICPC 2012 天津 A题 (模拟)
- HDU 5878 I Count Two Three (暴力) 2016 ACM/ICPC Asia Regional Qingdao Online
- hdu 4472 Count (2012 ACM-ICPC 成都现场赛)
- 2012ACM/ICPC成都赛区现场赛I题---Count(hdu4472)
- 【DP】【2012 ACM/ICPC 成都赛区现场赛】【I.Count】
- HDU-4472-Count (2012 ACM/ICPC成都现场赛)
- 【2015-2016 ACM-ICPC, NEERC, Southern Subregional Contest J】【暴力模拟】Cleaner Robot 机器人行走 决策固定
- hdu 4472 Count (2012 ACM-ICPC 成都现场赛)
- 2015ACM/ICPC亚洲区长春站 B hdu 5528 Count a * b
- ZOJ 3664 Split the Rectangle 第37届ACM/ICPC长春赛区现场赛 J 题(模拟建树,暴力 求LCA)
- hdu 5538 House Building 巧妙利用数组来模拟(2015ACM/ICPC亚洲区长春站-重现赛 )
- [BZOJ]2751: [HAOI2012]容易题(easy) 暴力+快速幂
- hdu 5878 I Count Two Three (2016 ACM/ICPC Asia Regional Qingdao Online 1001)
- ACM-ICPC 2012 长春.准备 2 (14张照片,外链)
- HDU 5878 I Count Two Three (打表+二分查找) -2016 ICPC 青岛赛区网络赛
- 2016 ACM/ICPC Asia Regional Shenyang Online && hdoj5901 Count primes Lehmer
- [报告]ACM-ICPC 2012 Regionals Asia - Changchun I Polaris of Pandora / ZJU 3663
- 2016ACM-ICPC网络赛北京赛区 1001 (trie树牌大模拟)
- 【NOIP2012模拟8.20】Memory