Wednesday, March 20, 2013

project euler problem 041

pandigital prime

This problem is simple and boring, one just need to figure out what is the maximum possible value for a pandigital prime and do not waste the cpu time on useless computation. It is easy to figure out after doing some test on small numbers.

No comments:

Post a Comment