通过此题有两个收获:
第一-----------------序数词的正确拼写。
第二----------------学会了map的基本使用方法。
---------------------------------------------------------------------------------------------------------------KeeP MoVing .............
#include<stdio.h>
#include<string.h>#include<queue>
#include<map>
#include<algorithm>
using namespace std;
#define max 5842+10
int h[max]={0,1};
int a[]={2,3,5,7};
typedef long long LL;
void init(){
priority_queue<LL,vector<LL>,greater<LL> > q;
map<LL,bool> vis;
for(int i=0;i<4;i++){
q.push(a[i]);
}
int cnt=2;
while(cnt<=5842){
LL now=q.top(); q.pop();
h[cnt++]=now;
for(int i=0;i<4;i++){
LL temp=now*a[i];
if(!vis[temp]){
vis[temp]=true;
q.push(temp);
}
}
}
}
int main(){
init();
int n;
while(~scanf("%d",&n),n){
if(n%10==1&&n%100!=11){
printf("The %dst humble number is %d.",n,h[n]);
}
else if(n%10==2&&n%100!=12){
printf("The %dnd humble number is %d.",n,h[n]);
}
else if(n%10==3&&n%100!=13){
printf("The %drd humble number is %d.",n,h[n]);
}
else{
printf("The %dth humble number is %d.",n,h[n]);
}
puts("");
}
}