zoukankan      html  css  js  c++  java
  • 幽默数

    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.
    //幽默数, 数字的质数只包括2,3,5,7;
    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.
             
     
     1 #include<stdio.h>
     2 #include<string.h>
     3 #include<stdlib.h>
     4 int main()
     5 {
     6     int x1, x2, x3, x4;
     7     int ac[6000], i, n, j, k, a, b, c, d, min;
     8     ac[1] = 1;
     9     a = b = c = d = 1;
    10     for(i = 2; i < 5900; i++)
    11     {
    12       x1 = ac[a] * 2;
    13       x2 = ac[b] * 3;
    14       x3 = ac[c] * 5;
    15       x4 = ac[d] * 7;
    16       min = x1;
    17       if(min > x2)min = x2;
    18       if(min > x3)min = x3;
    19       if(min > x4)min = x4;
    20       ac[i] = min;
    21       if(min == x1)a++;
    22       if(min == x2)b++;
    23       if(min == x3)c++;
    24       if(min == x4)d++;
    25     }
    26     while(scanf("%d", &n), n)
    27     {
    28         if(n%10 == 1 && n%100 != 11)
    29              printf("The %dst humble number is %d.
    ", n, ac[n]);
    30         else if(n%10 == 2 && n%100 != 12)
    31              printf("The %dnd humble number is %d.
    ", n, ac[n]);
    32         else if(n%10 == 3 && n%100 != 13)
    33              printf("The %drd humble number is %d.
    ", n, ac[n]);
    34         else
    35              printf("The %dth humble number is %d.
    ", n, ac[n]);
    36     }
    37     return 0;
    38 }
  • 相关阅读:
    Hadoop Python 调用自定义so动态库
    Golang Redigo连接Redis 简单使用
    Golang 错误 "bad file descriptor"
    Centos Git 安装与升级
    初识数据库
    MySQL介绍,下载和安装
    并发编程:协程
    并发编程:多线程
    并发编程:多进程
    操作系统,进程理论
  • 原文地址:https://www.cnblogs.com/yishilin/p/4396068.html
Copyright © 2011-2022 走看看