-
-
Save dekajp/4496303 to your computer and use it in GitHub Desktop.
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. http://projecteuler.net/problem=4
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
public class worker | |
{ | |
public worker(){ | |
} | |
public void start() | |
{ | |
int MAX_NUMBER = 999; | |
for (int Number = MAX_NUMBER; Number >= 0; Number--) | |
{ | |
string SNumberLeft = Number.ToString(); | |
string SNumberRight = Reverse(Number.ToString()); | |
int palindromic = Convert.ToInt32(SNumberLeft + SNumberRight); | |
for (int i = MAX_NUMBER; i >= 1; i--) | |
{ | |
for (int l = MAX_NUMBER; l >= 1; l--) | |
{ | |
if ((i * l) - palindromic == 0) | |
{ | |
System.Diagnostics.Debug.WriteLine("Result :" + palindromic); | |
return; | |
} | |
} | |
} | |
// System.Diagnostics.Debug.WriteLine( palindromic); | |
} | |
} | |
public string Reverse(String s) | |
{ | |
char[] arr = s.ToCharArray(); | |
Array.Reverse(arr); | |
return new string(arr); | |
} | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment