Humble Numbers
来源:互联网 发布:mac的照片怎么删除 编辑:程序博客网 时间:2024/05/17 04:05
http://acm.hdu.edu.cn/showproblem.php?pid=1058
Humble Numbers
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 20460 Accepted Submission(s): 8924
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
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
1234111213212223100100058420
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 <cstdio>#include <queue>#include <algorithm>#include <vector>#include <set>#include <string>#include <iostream>using namespace std;const __int64 step[4]={2,3,5,7};int ans[5850];int main(){ int n; priority_queue<__int64,vector<__int64>,greater<__int64> >q; set<int>a; q.push(1); a.insert(1); for(int i=1;i<=5842;i++){ __int64 x; x=q.top(); q.pop(); ans[i]=x; for(int j=0;j<4;j++) if(!a.count(step[j]*x)){ q.push(step[j]*x); a.insert(step[j]*x); } } while(scanf("%d",&n)!=EOF&&n){ string s; if(n%10==1&&n%100!=11)s="st"; else if(n%10==2&&n%100!=12)s="nd"; else if(n%10==3&&n%100!=13)s="rd"; else s="th"; cout<<"The "<<n<<s<<" humble number is "<<ans[n]<<'.'<<endl; }}
0 0
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- Humble Numbers
- 黑马程序员--IO流
- iframe与frame的区别
- Foundation Framework 数组 NSArray、NSMutableArray
- $.ajax相关用法
- Oracle提供的高可用方案
- Humble Numbers
- 设计模式之-----状态模式
- 再Visual Studio中构建Nunit测试环境
- Linux驱动学习-----Ubuntu12.04构建Linux源码树
- shiro 注解授权不起作用问题解决方案
- uva 10237 Bishops 黑白染色处理
- 由爱故生忧,由爱故生怖,若离于爱者,无忧亦无怖。
- 2015 Multi-University Training Contest 3 1002RGCDQ(hdu5317)
- 判断是手机还是电脑访问网站