acm_Humble Numbers

原创 2016年05月31日 19:50:36

题目:

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. <br><br>Write a program to find and print the nth element in this sequence<br>
 

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.<br>
 

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.<br>
 

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.
 

题意:每输入一个数n,让求从1开始的第n个Humble Numbers是多少,而Humble Numbers是因子只有2 3 5 7这几个数,当然1也算。。


思路:可以先用一个vector容器把这5842个数求出来。。然每输入一个数取就可以了。。


代码:

#include <iostream>
#include <string>
#include<stdio.h>
#include<vector>
#include<cmath>
using namespace std;
int inline min(int a,int b)
{
return a<b?a:b;
}
int main(){
int n = 5842, m;
char s[4][3]={"th","st","nd","rd"};
vector<int> v;
int a = 0, b = 0, c = 0, d = 0;
v.push_back(1);
while(--n){
int r2 = v[a] * 2;
int r3 = v[b] * 3;
int r5 = v[c] * 5;
int r7 = v[d] * 7;
m = min(r2, r3);
m = min(m, r5);
m = min(m, r7);
v.push_back(m);
if(r2 == m)
a+=1;
if(r3 == m)
b+=1;
if(r5 == m)
c+=1;
if(r7 == m)
d+=1;
}
while(cin>>n&&n!=0)
{
string cc=(n % 10 < 4 && n % 100 != 11 && n % 100 != 12 && n % 100 != 13)?s[n % 10]:"th";
cout<<"The "<<n<<cc<<" humble number is "<<v[n - 1]<<"."<<endl;
}
return 0;
}

相关文章推荐

ACM--steps--3.2.4--Humble Numbers

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

[ACM] hdu 1058 Humble Numbers

解题思路: 一个humble数指素数因子只有2,3 , 5, 7的数,比如1(也是), 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, ...

ACM-DP之Humble Numbers——hdu1058

ACM,DP,Humble Numbers,hdu1058

Humble Numbers 简单DP

  • 2012年10月08日 14:43
  • 49KB
  • 下载

hdu 1058 Humble Numbers 丑数

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

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

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

USACO 3.1 Humble Numbers

#include #define DEBUG 1 #define TESTCASES 9 #define MAX_PRIMES 100 #define MAX_N 100000 //注意别开小了 ...

杭电OJ——1058 Humble Numbers(用优先队列也可以解)

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

java 杭电1058Humble Numbers

Humble Numbers Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • z8110
  • z8110
  • 2016年05月21日 10:48
  • 300

Humble Numbers(dp)

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

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