Projecteuler.net – Problem 4 – C solution

http://projecteuler.net/problem=4

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.

It looks a mess. The %u in the printf statement I forgot to fix before taking a screen grab.

– Josh

 

 

 

This entry was posted in C, Project Euler. Bookmark the permalink.

Leave a Reply