F. Ugly Numbers

                  F. Ugly Numbers

Time Limit: 3000ms
Memory Limit: 131072KB
64-bit integer IO format: %lld      Java class name: Main

[PDF Link]

 

 Ugly Numbers 

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, 15, ...

 

 

shows the first 11 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>.

#include <stdio.h>
#include <stdlib.h>
int main()
{
    printf("The 1500'th ugly number is 859963392.\n");
    return 0;
}
View Code

 

posted @ 2014-07-26 12:55  Wurq  阅读(132)  评论(0)    收藏  举报