poj1338

#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;

int a[2000];
int n;

bool ok(int x)
{
int flag=1;
while(flag)
{
flag=0;
while(x%2==0)
{
flag=1;
x/=2;
}
while(x%3==0)
{
flag=1;
x/=3;

}

while(x%5==0)
{
flag=1;
x/=5;

}
}
return x==1;

}
int main()
{
int cnt=1;
int n1,n2,n3;
n1=1;
n2=1;
n3=1;
a[1]=1;
for(int i=2;i<=1500;i++)
{
int tmp=min(a[n1]*2,min(a[n2]*3,a[n3]*5));
a[i]=tmp;
if(tmp==a[n1]*2)
{
n1++;
}
if(tmp==a[n2]*3)
n2++;
if(tmp==a[n3]*5)
n3++;

}
while(scanf("%d",&n)!=EOF)
{
if(n==0)
break;
printf("%d\n",a
);

}

return 0;
}