zoukankan      html  css  js  c++  java
  • HDU1058Humble Numbers

     Humble Numbers
    Time Limit:1000MS     Memory Limit:32768KB     64bit IO Format:%I64d & %I64u
     
     

    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.
    题意:输出能被2或3或5或7整除的第n个数,注意题目的11,12,13后面是th。。。
     1 #include<bits/stdc++.h>
     2 using namespace std;
     3 int main() {
     4     int n,m2=1,m3=1,m5=1,m7=1,i,temp1,temp2;
     5     int a[6000];
     6     a[1]=1;
     7     for(i=2; i<=5843; i++) {
     8         a[i]=min(min(2*a[m2],3*a[m3]),min(5*a[m5],7*a[m7]));
     9         if(a[i]==2*a[m2]) m2++;
    10         if(a[i]==3*a[m3]) m3++;
    11         if(a[i]==5*a[m5]) m5++;
    12         if(a[i]==7*a[m7]) m7++;
    13     }
    14     while(cin>>n,n) {
    15         if(n%10==1&&n%100!=11)
    16             printf("The %dst humble number is %d.
    ",n,a[n]);
    17         else if(n%10==2&&n%100!=12)
    18             printf("The %dnd humble number is %d.
    ",n,a[n]);
    19         else if(n%10==3&&n%100!=13)
    20             printf("The %drd humble number is %d.
    ",n,a[n]);
    21         else
    22             printf("The %dth humble number is %d.
    ",n,a[n]);
    23     }
    24     return 0;
    25 }
  • 相关阅读:
    大数据分析防御威胁,中小企业安全的选择
    计算机鼻祖-Donald Knuth(高纳德) 的传奇
    [ExtJS5学习笔记]第五节 使用fontawesome给你的extjs5应用添加字体图标
    谁说技术男没有人文情怀:当旅途遇到生命赞歌
    控制器之间传值,逆传
    #include &lt;sys/socket.h&gt;找不到头文件
    怎样得到QML package的具体API接口
    Java面向对象编程(一)
    STL algorihtm算法iter_swap(29)
    jquery分页插件
  • 原文地址:https://www.cnblogs.com/zhien-aa/p/5694366.html
Copyright © 2011-2022 走看看