HDU-1058-Humble Numbers(暴力打表)
2016-10-15 16:09
405 查看
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24175 Accepted Submission(s): 10583
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.
代码
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 24175 Accepted Submission(s): 10583
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.
代码
#include<stdio.h> #include<iostream> #include<algorithm> #include<string.h> #include<math.h> using namespace std; const int maxn=5845; const int INF=2000000000; int main() { long long int AC[maxn];//这个数组可以AC int num=1; for(int i=0; i<=31&&pow(2,i)<=INF; i++) for(int j=0; j<=20&&pow(2,i)*pow(3,j)<=INF; j++) for(int k=0; k<=14&&pow(2,i)*pow(3,j)*pow(5,k)<=INF; k++) for(int t=0; t<=12&&pow(2,i)*pow(3,j)*pow(5,k)*pow(7,t)<=INF; t++) AC[num++]=pow(2,i)*pow(3,j)*pow(5,k)*pow(7,t); sort(AC+1,AC+num+1);//不要忘记排序 // printf("%d\n",num); int N; while(scanf("%d",&N)&&N) { printf("The %d",N); if(N%10==1&&N%100!=11) printf("st "); else if(N%10==2&&N%100!=12) printf("nd "); else if(N%10==3&&N%100!=13) printf("rd "); else printf("th "); printf("humble number is %I64d.\n",AC ); } return 0; }
相关文章推荐
- HDU 1058 Humble Numbers(打表+暴力)
- HDU:1058 Humble Numbers(技巧打表)
- HDU 1058 Humble Numbers 动态规划 或 暴力
- HDU-1058-Humble Numbers-暴力贪心
- HDU 1058 Humble Numbers 【暴力(DFS)】
- HDU-1058 Humble Numbers 暴力 Or 动态规划
- HDU 1058 Humble Numbers ..没用STL暴力过了
- HDU 1058 Humble Numbers(离线打表)
- HDU 1058 Humble Numbers(dp)
- HDU_1058 Humble Numbers(DP)
- hdu Humble Numbers(打表)
- HDU 1058 Humble Numbers(dp+greedy)
- HDU 1058 Humble Numbers
- hdu 5676 ztr loves lucky numbers(BC——暴力打表+二分查找)
- HDU 1058 Humble Numbers--DP--(计数器技巧)
- HDOJ 1058 Humble Numbers(打表过)
- hdu Humble Numbers(打表)
- hdu 1058 Humble Numbers
- HDU 1058 Humble Numbers(DP,数)
- 【HDU 1058 Humble Numbers】+ 思维