[Project Euler] Problem #458

Hint: 10^12 implies that we need to find O(1) or O(log(n))-level algorithm.

Another example: Problem #113.  10^100 implies that we cannot brute force by O(n) algorithm.