ZOJ 1095 Humble Numbers (构造)

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=1095

题目意思：某数的质因数分解中只含有2，3，5或7，则称该数为丑数。已知前20个丑数为1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 24, 25, 27。要求输出第n个丑数。

输出示例：

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.

解题思路：通过观察输出示例可以发现，第5842个丑数为2000000000，说明丑数实际上并不多，因此可以尝试将其一一构造出来。由于丑数的质因数分解中只含有2，3，5和7，因此构造的方法无非就是(若干个2相乘×若干个3相乘×若干个5相乘×若干个7相乘)，而且此构造方法可以保证不会重复，唯一的缺点是无序。

#include <stdio.h>
#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
int main()
{
    vector<int> v;
    for(double seven = 1; seven <= 2000000000; seven *= 7)
        for(double five = 1; five *seven <= 2000000000; five *= 5)
            for(double three = 1; three *five *seven <= 2000000000; three *= 3)
                for(double two = 1; two *three *five *seven <= 2000000000; two *= 2)
                {
                    v.push_back(two * three * five * seven);
                }
    std::sort(v.begin(), v.end());
    int n;
    while(cin >> n && n != 0)
    {
        if(n % 10 == 1 && n % 100 != 11)
            printf("The %dst humble number is %d./n", n, v[n-1]);
        else if(n % 10 == 2 && n % 100 != 12)
            printf("The %dnd humble number is %d./n", n, v[n-1]);
        else if(n % 10 == 3 && n % 100 != 13)
            printf("The %drd humble number is %d./n", n, v[n-1]);
        else
            printf("The %dth humble number is %d./n", n, v[n-1]);
    }
    return 0;
}