zoukankan      html  css  js  c++  java
  • HDU1058——Humble Numbers

    Problem Description
    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
     
    Input
    The 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.
     
    Output
    For 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.
     
    Source
     
    Recommend
    JGShining   |   We have carefully selected several similar problems for you:  1159 1069 1087 1176 1421 
    挺好的一道题,对于每个a[c1]即该值已经用过了c1个2,看接下来加进去什么数
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    int a[5900];
    int min1(int a,int b,int c,int d)
    {
        return min(min(min(a,b),c),d);
    }
    void inti()
    {
        int c1,c2,c3,c4;
        c1 = c2 = c3 = c4 = 1;
        a[1] = 1;
        for(int i = 2; i <= 5842; i++){
            a[i] = min1(2*a[c1],3*a[c2],5*a[c3],7*a[c4]);
            if(a[i] == 2*a[c1]) c1++;
            if(a[i] == 3*a[c2]) c2++;
            if(a[i] == 5*a[c3]) c3++;
            if(a[i] == 7*a[c4]) c4++;
            }
    }
    int main()
    {
        inti();
        int n;
        while(~scanf("%d",&n)&&n){
        if(n%100 == 11 || n%100 == 12 || n % 100 == 13){
            printf("The %dth humble number is %d.
    ",n,a[n]);
        }
        else if(n%10 == 1){
            printf("The %dst humble number is %d.
    ",n,a[n]);
        }
        else if(n%10 == 2){
            printf("The %dnd humble number is %d.
    ",n,a[n]);
        }
        else if(n%10 == 3){
            printf("The %drd humble number is %d.
    ",n,a[n]);
        }
        else printf("The %dth humble number is %d.
    ",n,a[n]);
        }
        return 0;
    }
        
    

      

  • 相关阅读:
    结对作业(1)--疫情统计可视化(原型设计)
    软工实践寒假作业(2/2)疫情统计程序
    最长回文
    吉哥系列故事——完美队形II ——Manacher算法
    友情链接
    代码互改——第二次个人编程作业
    汉字编程——第一次个人编程作业
    谈谈自己
    OO第一次博客
    OO第一单元作业总结
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4539294.html
Copyright © 2011-2022 走看看