码迷,mamicode.com
首页 > 其他好文 > 详细

Ugly Numbers(1.5.8)

时间:2019-05-03 11:50:31      阅读:114      评论:0      收藏:0      [点我收藏+]

标签:submit   mil   widget   ofo   title   man   sdi   phoenix   out   


Time Limit:1000MS?????Memory Limit:10000KB?????64bit IO Format:%I64d & %I64u

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

1
2
9
0

Sample Output

1
2
10
#include<iostream>
using namespace std;
int main( ) 
{ 
    int un[1505]={0}; 
    int m2=0,m3=0,m5=0,i,t; 
    un[0]=1; 
    for(i=1;i<1500;i++) 
    { 
        if(2*un[m2]>3*un[m3]) 
            t=un[m3]*3; 
        else 
            t=un[m2]*2; 
        if(t>un[m5]*5) 
            t=un[m5]*5; 
 
        if(t == 2*un[m2]) m2++; 
        if(t == 3*un[m3]) m3++; 
        if(t == 5*un[m5]) m5++; 
 
        un[i]=t; 
    } 
	int a;
  while(cin>>a&&a)
  {a--;cout<<un[a]<<endl;}
    return 0; 
} 


Ugly Numbers(1.5.8)

标签:submit   mil   widget   ofo   title   man   sdi   phoenix   out   

原文地址:https://www.cnblogs.com/mqxnongmin/p/10804530.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
分享档案
周排行
mamicode.com排行更多图片
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!