zoukankan      html  css  js  c++  java
  • hdu1058

    Humble Numbers

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 14933    Accepted Submission(s): 6494


    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.
     
     
    思路:寻找素数因子:(这是一个不断的测试的;取定因子,找出满足要求的数)
    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    #include<algorithm>
    #define MAX 5843
    using namespace std;
    int find_min(int a , int b , int c , int d)
    {
        int temp = a < b ? a : b ;
        int index = c < d ? c : d ;
        return (temp < index ? temp : index) ;
    }
    int main()
    {
        int i,j,n,ta,tb,tc,td,id1,id2,id3,id4;
        int dp[MAX];
        dp[0]=1;
        id1=id2=id3=id4=0;
        for(j=1; j<MAX; j++)
            {
                dp[j]=find_min(ta=dp[id1]*2,tb=dp[id2]*3,tc=dp[id3]*5,td=dp[id4]*7);
                if(dp[j]==ta)
                id1++;
                if(dp[j]==tb)
                id2++;
                if(dp[j]==tc)
                id3++;
                if(dp[j]==td)
                id4++;
            }
        while(cin>>n&&n)
        {
            if(n%10==1&&n%100!=11)
            {
                printf("The %dst humble number is %d.
    ",n,dp[n-1]);
                continue;
            }
            if(n%10==2&&n%100!=12)
            {
                printf("The %dnd humble number is %d.
    ",n,dp[n-1]);
                continue;
            }
            if(n%100!=13&&n%10==3)
            {
                printf("The %drd humble number is %d.
    ",n,dp[n-1]);
                continue;
            }
            printf("The %dth humble number is %d.
    ",n,dp[n-1]);
        }
        return 0;
    }
    

      

  • 相关阅读:
    webpack 配置别名,解决 import 时路径查找麻烦的问题
    Vue 中 diff 算法后更新 DOM 的方法
    React Native 开发环境搭建
    JavaScript 堆排序详解
    JavaScript 快速排序详解
    websocket 心跳重连
    AJAX 请求后使用 JS 打开新标签页被阻止的解决方法
    auto.js环境搭建
    Mac os 创建pppoe拨号
    mac os IntelliJ IDEA搭建环境
  • 原文地址:https://www.cnblogs.com/lxm940130740/p/3582693.html
Copyright © 2011-2022 走看看