Ugly Numbers UVA136 POJ1338

Ugly numbers are numbers whose only prime factors are 2, 3 or 5. The sequence 1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ... shows the first 11 ugly numbers. By convention, 1 is included. Write a program to find and print the 1500’th ugly number. Input There is no input to this program. Output Output should consist of a single line as shown below, with ‘’ replaced by the number computed. Sample Output The 1500'th ugly number is .

//ugly numbers
#include<cstdio>
#include<queue>
#include<set>
#include<iostream>
using namespace std;
typedef long long ll;

ll  result[1505];
void QUEUE()
{
    ll i=0;
    //priority_queue<ll, vector<ll>, greater<ll> > s;//priority_queue<ll,vector<ll>,greater<ll> >s;就是这个vector是不定长数组，然后greater是使队列中最小的在最上面，最大的在最下面。同理要是less的话就与此相反。
    set<ll> s;
    s.insert(1);
    while(i <= 1500)
    {
        set<ll>::iterator k = s.begin();

  if(i>0 && *k==result[i-1])//去重
            continue;

        result[i++] = *k;
        s.erase(result[i-1]);

        s.insert(result[i-1]*2);
        s.insert(result[i-1]*3);
        s.insert(result[i-1]*5);
/*        for(set<int>::iterator j = s.begin(); j != s.end(); j++)
            cout << *j <<  " ";
        cout << endl;
*/

    }
}
int main()
{
    ll n;
    QUEUE();

   /* while(~scanf("%lld", &n) && n)
    {
        printf("%lld\n", result[n-1]);
    }*/
    printf("The 1500'th ugly number is %d.\n",result[1499]);
    return 0;
}