zoukankan      html  css  js  c++  java
  • HDU 1058

    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.

    每个数字,乘以2、3、5、7都会产生一个新的num

     1 #include<cstdio>
     2 int min(const int a,const int b,const int c,const int d)
     3 {
     4     int m=a;
     5     if(m>b) m=b;
     6     if(m>c) m=c;
     7     if(m>d) m=d;
     8     return m;
     9 } 
    10 int num[5845]={0,1};
    11 int main()
    12 {
    13     int c2=1,c3=1,c5=1,c7=1;
    14     for(int i=2;i<=5842;i++){
    15         
    16         num[i]=min(2*num[c2],3*num[c3],5*num[c5],7*num[c7]);
    17         
    18         if(num[i]==2*num[c2]) c2++;
    19         if(num[i]==3*num[c3]) c3++;
    20         if(num[i]==5*num[c5]) c5++;
    21         if(num[i]==7*num[c7]) c7++;
    22         
    23     }
    24     
    25     int n;char* str[]={"th","st","nd","rd","th","th","th","th","th","th"};
    26     while(scanf("%d",&n) && n>0){
    27         int xh=n%10;
    28         if(n%100==11 || n%100==12 || n%100==13) xh=0; 
    29         printf("The %d%s humble number is %d.
    ",n,str[xh],num[n]);
    30     }
    31 }


     

  • 相关阅读:
    window 7系统环境同时安装window xp系统,形成双系统
    工作感悟
    数据湖框架选型很纠结?一文了解Apache Hudi核心优势
    mysql数据库设计-规则
    maven中多个子模块的构建顺序
    EXTJS3.0 表单元素TextField datefield 设置只读并改背景颜色为灰色
    MySQL5.7的账号回收权限
    哲学王子-复旦博导王德峰教授:阅读与哲学思考
    abseil 的 cmake 方式编译
    [javascript] ie下audio不支持一些媒体类型
  • 原文地址:https://www.cnblogs.com/dilthey/p/6804176.html
Copyright © 2011-2022 走看看