标签：
http://acm.hdu.edu.cn/showproblem.php?pid=1058
1 2 3 4 11 12 13 21 22 23 100 1000 5842 0
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;
}
}版权声明：本文为博主原创文章，未经博主允许不得转载。
标签：
原文地址：http://blog.csdn.net/burning_newbie/article/details/47122263
