poj 1338 打表

最新推荐文章于 2015-09-05 17:00:05 发布

一个上进的小学生

最新推荐文章于 2015-09-05 17:00:05 发布

阅读量294

点赞数

分类专栏： poj

本文链接：https://blog.csdn.net/forsakemyheart/article/details/8821186

版权

poj 专栏收录该内容

29 篇文章 0 订阅

订阅专栏

Ugly Numbers

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 17737		Accepted: 7866

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 136

#include <iostream>
using namespace std;

int min(int a,int b,int c)
{
	if(b<a)
		a=b;
	if(c<a)
		a=c;
	return a;
}
int main()
{
	int n;
	int i2_mul;
	int i3_mul;
	int i5_mul;
	long ugly[1501];

	i2_mul = 1;
	i3_mul = 1;
	i5_mul = 1;
	ugly[1]=1;

	for(  int i = 2; i <= 1500; i++ )
	{
		ugly[i] = min(ugly[i2_mul]*2,ugly[i3_mul]*3,ugly[i5_mul]*5);
		if(ugly[i] == ugly[i2_mul]*2 )
			i2_mul++;
		if(ugly[i] == ugly[i3_mul]*3 )
			i3_mul++;
		if(ugly[i] == ugly[i5_mul]*5)
			i5_mul++;
	
	}
	while(true){
		scanf("%d",&n);
		if( n == 0 )
			break;
		printf("%d\n",ugly[n]);
	}
	return 0;
}