zoukankan      html  css  js  c++  java
  • hdu4472-Count

    Count

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 1092    Accepted Submission(s): 717


    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
     
    Recommend
    liuyiding
     
     1 #include<stdio.h>
     2 #include<string.h>
     3 const int MAX=1000000007;
     4 int dp[1002];
     5 void dp1()
     6 {
     7     dp[1]=1;
     8     dp[2]=1;
     9     dp[3]=2;
    10     dp[4]=3;
    11     for(int i=5;i<1001;i++)
    12     {
    13         for(int j=1;j<i;j++)
    14         {
    15             if((i-1)%j==0)
    16             {
    17                 dp[i]+=dp[j];
    18                 dp[i]=dp[i]%MAX;
    19             }
    20         }
    21     }
    22 }
    23 int main()
    24 {
    25     int n;
    26     int t=1;
    27     dp1();
    28     while(scanf("%d",&n)!=EOF)
    29     {
    30         printf("Case %d: %d
    ",t,dp[n]);
    31         t++;
    32     }
    33     return 0;
    34 }
    View Code
  • 相关阅读:
    类的加载过程 以及实例的加载顺序
    设计优化之单例模式
    Java程序性能优化之性能概述
    1-12接口
    1-11多态
    1-9方法的重写(override)
    1-6static关键字
    1-10super和this关键字
    1-8继承extends
    1-7代码块的分类
  • 原文地址:https://www.cnblogs.com/ACshasow/p/3416131.html
Copyright © 2011-2022 走看看