poj1338 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 and Output

There is no input to this program. Output should consist of a single line as shown below, with <number> replaced by the number computed.

Sample output

The 1500'th ugly number is <number>.

  

思路：用一个长度为1500的数组存储这些数，另有三个游标x,y,z；

a[1]=1，x=y=z=1，代表第一个数为1，此后的数都是通过已有的数乘以2,3,5得到的，

那么x，y，z分别代表a[x],a[y],a[z]可以通过乘以2,3,5来得到新的数，i递增，每次取2*a[x], 3*a[y], 5*a[z]

中的最小值，得到a[i]后，可以将对应的x(或y,z)右移，当然如果原本通过3*2得到6，那么2*3也能得到6，

因此可能x和y都需要递增。

#include <iostream>
using namespace std;
int min(int a, int b, int c)
{
  return min(a,min(b,c));
}
int main()
{
  int a[1517];
  int x, y, z, i;
  x = y = z = 1, a[1] = 1;
  for(i = 2; i <= 1500; i++)
  {
    a[i] = min(2*a[x],3*a[y],5*a[z]);
    if(a[i] == 2*a[x])
    x++;
    if(a[i] == 3*a[y])
    y++;
    if(a[i] == 5*a[z])
    z++;
  }
  int n;
  while(cin >> n && n)
  {
    cout<<a[n]<<endl;
  }
  return 0;
}