UVa 136 Ugly Numbers (number theory)

136-ugly Numbers

Time limit:3.000 seconds

Http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem &problem=72

Ugly numbers are numbers whose only prime factors 2, 3 or 5. The sequence

1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 15, ...

Shows the 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>.

You can use violence to figure out the answer first.

Or, use 2,3,5 to put together.

Complete code:

/*0.009s*/
  
#include <cstdio>
  
int main (void)
{
    puts ("The 1500 ' th ugly number is 859963392.");
    return 0;
}

See more highlights of this column: http://www.bianceng.cnhttp://www.bianceng.cn/Programming/sjjg/