ACM暑假集训_STL&模拟_E-Ugly Numbers
Description
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 ‘<number>’ replaced by the number computed
Sample Input
Sample Output
The 1500'th ugly number is <number>.
Hint
解题思路
最开始的想法肯定是每一个数直接除2,3,5,但时间复杂度过高,会超时,只能想其他的办法。
丑数一定是在原有丑数基础上乘2,3,5得到的,所以只需要在已知丑数基础上找到下一个丑数就可以了。
代码
#include<iostream>
using namespace std;
int a[1500];
int Min(int M2,int M3,int M5)
{
int min=(M2<M3)?M2:M3;
min=(min<M5)?min:M5;
return min;
}
int main()
{
a[0]=1;
int *T2,*T3,*T5,M2,M3,M5;
T2=T3=T5=a;
for(int i=0;i<1500;i++)
{
if((*T2)*2<=a[i])
{
T2++;
}
if((*T3)*3<=a[i])
{
T3++;
}
if((*T5)*5<=a[i])
{
T5++;
}
M2=(*T2)*2;
M3=(*T3)*3;
M5=(*T5)*5;
a[i+1]=Min(M2,M3,M5);
}
cout<<"The 1500'th ugly number is "<<a[1499]<<"."<<endl;
return 0;
}