zoukankan      html  css  js  c++  java
  • hdu4028 The time of a day[map优化dp]

    The time of a day

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others)
    Total Submission(s): 1297    Accepted Submission(s): 594


    Problem Description
    There are no days and nights on byte island, so the residents here can hardly determine the length of a single day. Fortunately, they have invented a clock with several pointers. They have N pointers which can move round the clock. Every pointer ticks once per second, and the i-th pointer move to the starting position after i times of ticks. The wise of the byte island decide to define a day as the time interval between the initial time and the first time when all the pointers moves to the position exactly the same as the initial time.
    The wise of the island decide to choose some of the N pointers to make the length of the day greater or equal to M. They want to know how many different ways there are to make it possible.
     
    Input
    There are a lot of test cases. The first line of input contains exactly one integer, indicating the number of test cases.
      For each test cases, there are only one line contains two integers N and M, indicating the number of pointers and the lower bound for seconds of a day M. (1 <= N <= 40, 1 <= M <= 263-1)
     
    Output
    For each test case, output a single integer denoting the number of ways.
     
    Sample Input
    3 5 5 10 1 10 128
     
    Sample Output
    Case #1: 22 Case #2: 1023 Case #3: 586
     
    Source
     
    Recommend
    lcy   |   We have carefully selected several similar problems for you:  4027 4022 4023 4026 4021 
     
    #include<map>
    #include<cstdio>
    using namespace std;
    typedef long long ll;
    map<ll,ll>f[45];ll m,ans;int n,cas,Cas;
    map<ll,ll>::iterator it,ii;
    ll gcd(ll a,ll b){return !b?a:gcd(b,a%b);}
    ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
    int main(){
        f[1][1]=1;
        for(int i=1;i<=40;i++){
            f[i]=f[i-1];
            f[i][i]++;
            for(it=f[i-1].begin();it!=f[i-1].end();it++){
                f[i][lcm(it->first,i)]+=it->second;
            }
        }
        for(scanf("%d",&Cas),cas=1;cas<=Cas;cas++){
            scanf("%d%I64d",&n,&m);printf("Case #%d: ",cas);
            ans=0;
            for(it=f[n].begin();it!=f[n].end();it++){
                if(it->first>=m) ans+=it->second;
            }
            printf("%I64d
    ",ans);
        }
        return 0;
    } 
  • 相关阅读:
    虚拟机下unbuntu上网
    Ubuntu 用户切换和管理
    Brew程序模拟器上运行出现中文乱码
    struts2+spring+hibernate实例
    ubuntu ip设置
    JavaScript常用总结
    C++动态创建二维数组和清空cin缓冲
    🍖类的组合
    🍖鸭子类型
    🍖类的多态与多态性
  • 原文地址:https://www.cnblogs.com/shenben/p/6711084.html
Copyright © 2011-2022 走看看