题目不难,谁都能得到答案,就是看谁快。反正我是想不出来能3S内算出来的方法了,参考了书上的代码,受教受教……
1、自己的代码,可以得出答案,不能AC,运行时间长达38s,o(╥﹏╥)o
#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int cnt = 0;
unsigned long long i,j;
for(i = 1;i <= 4294967294;i++)
{
j = i;
while(j % 2 == 0 && j != 1)
{
j = j/2;
}
while(j % 3 == 0 && j != 1)
{
j = j/3;
}
while(j % 5 == 0 && j != 1)
{
j = j/5;
}
if(j == 1)
{
cnt++;
}
if(cnt == 1500)
{
printf("The 1500'th ugly number is %lld\n",i);
break;
}
}
return 0;
}
2、书上的代码,妥妥AC,运行时间还不到1S,牛啤啊
#include<iostream>
#include<vector>
#include<queue>
#include<set>
using namespace std;
typedef long long LL;
const int coeff[3] = {2,3,5};
int main()
{
priority_queue<LL,vector<LL>,greater<LL> > pq; //数字越小,优先级越高
set<LL> s;
pq.push(1);
s.insert(1);
int i,cnt = 0;
while(1)
{
LL x = pq.top();
pq.pop();
cnt++;
if(cnt == 1500)
{
cout << "The 1500'th ugly number is " << x << ".\n";
break;
}
for(i = 0;i < 3;i++)
{
LL x2 = x * coeff[i];
if(!s.count(x2))
{
s.insert(x2);
pq.push(x2);
}
}
}
return 0;
}