zoukankan      html  css  js  c++  java
  • 【hdu 1058】

    Humble Numbers

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


    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
     
     
     1 #include <iostream>
     2 using namespace std;
     3 
     4 #define MAXN 5843
     5 
     6 int CCalMin(int a, int b)
     7 {
     8     return a < b? a: b;
     9 }
    10 
    11 int main()
    12 {
    13     long long int arr_num[MAXN];
    14     
    15     // init for array arr_num[]
    16     arr_num[1] = 1;
    17     int a = 1;
    18     int b = 1;
    19     int c = 1;
    20     int d = 1;
    21     
    22     for (int i = 2; i < MAXN; i++)
    23     {
    24         arr_num[i] = CCalMin(CCalMin(arr_num[a] * 2, arr_num[b] * 3),CCalMin(arr_num[c] * 5, arr_num[d] * 7));
    25         if (arr_num[i] == arr_num[a] * 2)
    26         {
    27             a++;
    28         }
    29         
    30         if (arr_num[i] == arr_num[b] * 3)
    31         {
    32             b++;
    33         }
    34         
    35         if (arr_num[i] == arr_num[c] * 5)
    36         {
    37             c++;
    38         }
    39         
    40         if (arr_num[i] == arr_num[d] * 7)
    41         {
    42             d++;
    43         }
    44         
    45         
    46         
    47     }
    48     
    49     // output for result
    50     int n;
    51     while (cin >> n && n)
    52     {
    53         cout << "The " << n;
    54         if (n % 100 != 11 && n % 10 == 1)
    55         {
    56             cout << "st";
    57         }
    58         else if (n % 100 != 12 && n % 10 == 2)
    59         {
    60             cout << "nd";
    61         }
    62         else if (n % 100 != 13 && n % 10 == 3)
    63         {
    64             cout << "rd";
    65         }
    66         else
    67         {
    68             cout << "th";
    69         }
    70         
    71         cout << " humble number is " << arr_num[n] << "." << endl;
    72     }
    73     
    74     
    75     return 0;
    76 }
    77 // end 
    78 // ism 
  • 相关阅读:
    c#项目架构搭建经验
    c++ template怎么使用及注意事项
    c++怎么将一个类,拆分出接口类,和实现类
    c++l类
    错过C++
    Fixed 鸟粪一样的TreeView下的NodeMouseDoubleClick Bug
    Oracle 12C 新特性之表分区带 异步全局索引异步维护(一次add、truncate、drop、spilt、merge多个分区)
    Oracle 12C 新特性之在线重命名、迁移活跃的数据文件
    Oracle 12C 新特性之级联truncate
    Oracle 12C 新特性之扩展数据类型(extended data type)
  • 原文地址:https://www.cnblogs.com/ismdeep/p/2533024.html
Copyright © 2011-2022 走看看