zoukankan      html  css  js  c++  java
  • HOJ 1444 Humble Numbers

    Humble Numbers
    My Tags (Edit)
    Source : University of Ulm Internal Contest 1996
    Time limit : 1 sec Memory limit : 32 M
    Submitted : 578, Accepted : 273
    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 Specification
    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 Specification
    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.

    #include <iostream>
    #include <string.h>
    #include <stdlib.h>
    #include <math.h>
    #include <algorithm>
    
    using namespace std;
    int dp[6000];
    int n;
    int main()
    {
        int a=1,b=1,c=1,d=1;
        dp[1]=1;
        int cnt=1;
        while(cnt<5842)
        {
            int num=min(dp[a]*2,min(dp[b]*3,min(dp[c]*5,dp[d]*7)));
            if(num==dp[a]*2)
                a++;
            if(num==dp[b]*3)
                b++;
            if(num==dp[c]*5)
                c++;
            if(num==dp[d]*7)
                d++;
            dp[++cnt]=num;
        }
    
        while(scanf("%d",&n)!=EOF)
        {
            if(n==0)
                break;
            int x=n%10;
            if(x==1&&(n%100)!=11)
                printf("The %dst humble number is %d.
    ",n,dp[n]);
            else if(x==2&&(n%100)!=12)
                printf("The %dnd humble number is %d.
    ",n,dp[n]);
            else if(x==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;
    }
  • 相关阅读:
    Linux运维系列一 CentOS 7桌面系统加入到Samba4 AD域环境中
    Django 系列一 (创建第一个工程)
    提高运维效率(二)桌面显示IP
    提高运维效率(一)远程管理
    python group()
    【原创】我所理解的资源加载方式
    【原创】我所理解的自动更新-知识点讲解
    【原创】我所理解的自动更新-客户端更新流程
    【原创】我所理解的自动更新-资源打包流程
    【原创】我所理解的自动更新-APP发布与后台发布
  • 原文地址:https://www.cnblogs.com/dacc123/p/8228804.html
Copyright © 2011-2022 走看看