HDU 4472 Count

最新推荐文章于 2019-08-03 20:06:34 发布

原创最新推荐文章于 2019-08-03 20:06:34 发布 · 407 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#HDU #4472 #Count

hdu oj 专栏收录该内容

122 篇文章

订阅专栏

本文介绍了一种计算和谐村落配置数量的方法。和谐村落是指每个成员（除村长外）都有且仅有一个直接上司，且同一层级的所有人都拥有相同数量的下属。文章提供了一个丑陋但有效的代码实现，通过递推方式计算不同规模的和谐村落配置总数。

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 10 ⁹ +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

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

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 long
using 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;
}