UVa 136 - Ugly Numbers

136 - Ugly Numbers

 * http://acm.uva.es/p/v1/136.html

Summary
Since there is no input to this problem (you only need to print a certain string), brute forcing will be fine done locally. The number will fit comfortably into a 32-bit signed integer. Instead of brute forcing it, you could use dynamic programming to build up the solution.

Explanation
This problem uses the fact that $$n$$ is an ugly number if $$n - i, i \in ( 2, 3, 5 )$$ is an ugly number. We can then use Dynamic Programming to fill in the rest.

Input
There is no input to this problem.

Output
There is only one output to this problem.