zoukankan      html  css  js  c++  java
  • POJ 2247 Humble Numbers

    Humble Numbers
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 8831   Accepted: 4185

    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则该数为humble number,输入一个数字n求第n个humble number。
    #include <stdio.h>
    #include <iostream>
    #include <string.h>
    using namespace std;
    
    int Min(int num1, int num2, int num3, int num4)
    {
        return min(num1, min(num2, min(num3, num4)));
    }
    
    int main()
    {
        int n2 = 1, n3 = 1, n5 = 1, n7 = 1, n;
        int humble[6000];
        humble[1] = 1;
        for (int i = 2; i <= 5850; i++)
        {
            humble[i] = Min(humble[n2] * 2, humble[n3] * 3, humble[n5] * 5, humble[n7] * 7);
            if (humble[i] == humble[n2] * 2)
            {
                n2++;
            }
            if (humble[i] == humble[n3] * 3)
            {
                n3++;
            }
            if (humble[i] == humble[n5] * 5)
            {
                n5++;
            }
            if (humble[i] == humble[n7] * 7)
            {
                n7++;
            }
        }
        while(scanf("%d", &n) != EOF && n != 0)
        {
            if (n % 10 == 1 && n % 100 != 11)
            {
                printf("The %dst humble number is %d.
    ", n, humble[n]);
            }
            else
            {
                if (n % 10 == 2 && n % 100 != 12)
                {
                    printf("The %dnd humble number is %d.
    ", n, humble[n]);
                }
                else
                {
                    if (n % 10 == 3 && n % 100 != 13)
                    {
                        printf("The %drd humble number is %d.
    ", n, humble[n]);
                    }
                    else
                    {
                        printf("The %dth humble number is %d.
    ", n, humble[n]);
                    }
                }
            }
        }
        return 0;
    }
     
  • 相关阅读:
    thinkinginjava学习笔记07_多态
    thinkinginjava学习笔记06_复用类
    thinkinginjava学习笔记05_访问权限
    thinkinginjava学习笔记04_初始化与清理
    thinkinginjava学习笔记03_基本语法
    thinkinginjava学习笔记02_对象
    关于药物刺激引起的突变
    通路共出现
    关于reference-free去卷积
    一些研究生期间的反思
  • 原文地址:https://www.cnblogs.com/lzmfywz/p/3244726.html
Copyright © 2011-2022 走看看