hdoj1058 Humble Numbers ( set 水)

原创 2013年12月02日 18:52:05

题目:http://acm.hdu.edu.cn/showproblem.php?pid=1058

Humble Numbers

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.
简单的set<>去重

#include<stdio.h>
#include<set>
#include<iostream>
using namespace std;
#define  LL __int64
LL a[6000];
LL b[4]={2,3,5,7};
set <LL > num;
int main()
{
    LL i,j,m,k;
    num.insert(1);
    set<LL >::iterator t;

    for(i=1;i<=5842;i++)
    {
        t=num.begin();
        for(j=0;j<4;j++)
            if((*t)*b[j]<=2000000000)num.insert((*t)*b[j]);
            a[i]=*t;
            num.erase(t);
    }
    while(scanf("%I64d",&k)&&k!=0)
    {
        if(k%10==1&&k%100!=11)printf("The %I64dst humble number is %I64d.\n",k,a[k]);
        else
        if(k%10==2&&k%100!=12)printf("The %I64dnd humble number is %I64d.\n",k,a[k]);
        else
        if(k%10==3&&k%100!=13)printf("The %I64drd humble number is %I64d.\n",k,a[k]);
        else
        printf("The %I64dth humble number is %I64d.\n",k,a[k]);
    }
    return 0;

}




版权声明:本文为博主原创文章,未经博主允许不得转载。

HDOJ题目1058Humble Numbers(数学,丑数)

Humble Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

HDOJ 1058 Humble Numbers解题报告【DP】

Humble NumbersProblem Description A number whose only prime factors are 2,3,5 or 7 is called a humb...

HDoj-1058-Humble Numbers

Humble Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

HDOJ 1058 Humble Numbers(基础DP方程)

Humble Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...

hdu 1058 Humble Numbers 丑数(set,优先队列应用)

题目要求,如果一个数的素因数(因数中的素数),只有2,3,5,7,那么这个数称为丑数,输入一个数n,求第n个丑数 题目给出了前20个丑数 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, ...

HDOJ 1058:Humble Numbers 寻找丑数问题 解题报告

符合要求的丑数只含有2、3、5、7的质因子 求前5842个丑数 解题思想为:下一个最小的丑数一定在它前面的每个元素分别与2、3、5、7的乘积的结果中产生 而实际上只需跟踪4个数列即f[a]*2, f...

寻找丑数问题 HDOJ 1058 Humble Numbers

这道题目曾经也是Google、Hulu的一道面试题。对于这道题目,关键是要能够想到这一点:即对于任意一个丑数f[i],它都是由它前面的丑数乘以2,3,5或者7得到的。那么如果我们已经得到f[0] 到 ...

HDOJ 1058Humble Numbers

Problem Description A number whose only prime factors are 2,3,5 or 7 is called a humble number. T...

hdu 1058 Humble Numbers ( 构造因子为给定数的数序列、打表 )

==================================== #include #include #include using namespace std; #define Max...
  • YZBYZZ
  • YZBYZZ
  • 2013年07月13日 11:15
  • 555

HDU1058 Humble Numbers 【数论】

Humble Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:hdoj1058 Humble Numbers ( set 水)
举报原因:
原因补充:

(最多只允许输入30个字)