39 for( x = 999; x >= 100; x-- ) {
40 for( y = 999; y >= x; y-- ) {
41 r = x * y;
42 printf("%u * %u = %u\n", x, y, r);
43
44 if( is_palindrome( r ) ){
45 printf("I has it: %d\n", r);
46 return 0;
47 }
48 }
49 }
A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 × 99.
Find the largest palindrome made from the product of two 3-digit numbers.
999*991=990009
harryh wrote:Have you also looked at the pdf for the problem?
If you have, and if you are absolutely certain that your method is faster than that, you can PM me your method.
We will then consider re-opening the thread.
Return to Clarifications on Project Euler Problems
Users browsing this forum: No registered users and 1 guest