project euler problem 125

 Palindromic sums

This is a simple problem. Almost everyone is using brute force method. Although some of the brute force are clever, and some need more cpu time. Other than that, there is not much to learn. But if you read carefully, you still can see something interesting. One guy provided a better way to detect palindrome number, it is on page 2 by ped. 

I tested this algorithm, with my implementation, my code runs for 40ms. With the new isPalindromic function, it reduces to 32ms. Really nice job!

There is a much more difficult problem which is related to this problem, problem 261.