zoukankan      html  css  js  c++  java
  • Humble Numbers HDU

    A number whose only prime factors are 2,3,5 or 7 is called a humble number. The sequence 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27, ... shows the first 20 humble numbers. 

    Write a program to find and print the nth element in this sequence 

    InputThe input consists of one or more test cases. Each test case consists of one integer n with 1 <= n <= 5842. Input is terminated by a value of zero (0) for n. 
    OutputFor each test case, print one line saying "The nth humble number is number.". Depending on the value of n, the correct suffix "st", "nd", "rd", or "th" for the ordinal number nth has to be used like it is shown in the sample output. 
    Sample Input

    1
    2
    3
    4
    11
    12
    13
    21
    22
    23
    100
    1000
    5842
    0

    Sample Output

    The 1st humble number is 1.
    The 2nd humble number is 2.
    The 3rd humble number is 3.
    The 4th humble number is 4.
    The 11th humble number is 12.
    The 12th humble number is 14.
    The 13th humble number is 15.
    The 21st humble number is 28.
    The 22nd humble number is 30.
    The 23rd humble number is 32.
    The 100th humble number is 450.
    The 1000th humble number is 385875.
    The 5842nd humble number is 2000000000.


    丑数
     dp[i]=min(min(dp[a]*2,dp[d]*7),min(dp[b]*3,dp[c]*5));
        if(dp[i]==dp[a]*2) a++;
        if(dp[i]==dp[b]*3) b++;
        if(dp[i]==dp[c]*5) c++;
        if(dp[i]==dp[d]*7) d++;
    

     输出的时候 注意13 12 11

    #include <iostream>
    #include<stdio.h>
    #include<algorithm>
    #include<string.h>
    using namespace std;
    int dp[6000];
    int main()
    {
        dp[1]=1;
        int a=1,b=1,c=1,d=1;
        for(int i=2;i<=5842;i++)
        {
          dp[i]=min(min(dp[a]*2,dp[d]*7),min(dp[b]*3,dp[c]*5));
        if(dp[i]==dp[a]*2) a++;
        if(dp[i]==dp[b]*3) b++;
        if(dp[i]==dp[c]*5) c++;
        if(dp[i]==dp[d]*7) d++;
    
        }
        int n;
        while(~scanf("%d",&n)&&n)
        {
            if(n%10==1&&n%100!=11)
                printf("The %dst humble number is %d.
    ",n,dp[n]);
            else if(n%10==2&&n%100!=12)
                printf("The %dnd humble number is %d.
    ",n,dp[n]);
                 else if(n%10==3&&n%100!=13)
                printf("The %drd humble number is %d.
    ",n,dp[n]);
                 else
                printf("The %dth humble number is %d.
    ",n,dp[n]);
    
        }
    
        return 0;
    }
  • 相关阅读:
    Unity 2018 version class.jar path
    GitHub git
    QT install
    Android Studio 安装及汉化
    Unity 调用android
    JAVA 调用c++ 扩展 批评那些垃圾,
    JAVA java调用C++动态链接库dll,有详细过程。VS2015+Eclipse以及失败解决方案
    前端将数据转化为弹幕效果的实现方式
    css圣杯布局的实现方式
    浏览器缓存问题原理以及解决方案
  • 原文地址:https://www.cnblogs.com/2014slx/p/7306950.html
Copyright © 2011-2022 走看看