project euler problem 119

Digit power sum

This is a simple problem.  I rewrote my code, and it runs in less than 1ms. One just need control the maximum value of the base. Other than that, there is nothing to say about this problem.