Humble Numbers

其实有时候动归用集合会让思路更简洁，但是时间会多一些。。

#include<iostream>
#include<set>
using namespace std;

int main()
{
    int f[4] = {2,3,5,7};
    set<long long> s;
    //set<int> ss;
    set<long long>::iterator it;
    s.clear();
    //ss.clear();
    s.insert(1);
    int count = 1;
    for(it = s.begin(); count <= 20000 && it!=s.end(); it++)
    {
        for(int i=0; i<4; i++)
        {
            s.insert(f[i] * (*it));
            count ++;
        }
    }
    int ans[5843]={0};
    int i = 0;
    for(it=s.begin(); i<=5842 && it!=s.end(); it++)
    {
        //    cout << *it << " | " ;
        ans[++i] = (*it);
    }
    //for(i=0; i<5843; i++) cout << ans[i] << " ";
    int n;
    while(cin >> n, n)
    {
        if(n%100==11 || n%100==12 || n%100==13)cout << "The "<< n << "th humble number is " << ans[n] << ".\n";
        else if(n%10==1) cout << "The "<< n << "st humble number is " << ans[n] << ".\n";
        else if(n%10==2) cout << "The "<< n << "nd humble number is " << ans[n] << ".\n";
        else if(n%10==3) cout << "The "<< n << "rd humble number is " << ans[n] << ".\n";
        else cout << "The "<< n << "th humble number is " << ans[n] << ".\n";
    }

    return 0;
}