POJ 1338 Ugly Numbers

最新推荐文章于 2017-03-04 14:08:55 发布

hqu_fritz

最新推荐文章于 2017-03-04 14:08:55 发布

阅读量408

点赞数

分类专栏：杂例

本文链接：https://blog.csdn.net/hqu_fritz/article/details/8218521

版权

杂例专栏收录该内容

7 篇文章 0 订阅

订阅专栏

Ugly Numbers

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 16997		Accepted: 7558

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, ...
shows the first 10 ugly numbers. By convention, 1 is included.
Given the integer n,write a program to find and print the n'th ugly number.

Input

Each line of the input contains a postisive integer n (n <= 1500).Input is terminated by a line with n=0.

Output

For each line, output the n’th ugly number .:Don’t deal with the line with n=0.

Sample Input

Sample Output

1
2
10

Source

New Zealand 1990 Division I,UVA 13

解题思路：从1开始向后乘，分别乘以2,3,5，记录下应加入数列的最小值，再改变乘数，用三个指针分别标示乘到哪个位置，最后完成一个完整数列，输出即可。

#include<iostream>
using namespace std;
long min(long a,long b,long c)
{
	if(a>b)
		a=b;
	if(a>c)
		a=c;
	return a;
}
int main()
{
	int i,n,p=1,q=1,r=1,t;
	long m1=2,m2=3,m3=5;
	long ans[1600];
	memset(ans,0,sizeof(ans));
	ans[1]=1;
	for(i=2;i<=1500;i++)
	{
		t=min(m1,m2,m3);
		ans[i]=t;
        if(t==m1)
			m1=ans[++p]*2;
		if(t==m2)
			m2=ans[++q]*3;
		if(t==m3)
			m3=ans[++r]*5;
	}
		while(cin>>n&&n)
			cout<<ans[n]<<endl;
	return 0;	
}