
Untitled
By: a guest on
Mar 12th, 2011 | syntax:
Perl | size: 0.57 KB | hits: 57 | expires: Never
$L = 1000;
for ($A = 100 ; $A < $L ; $A++)
{
for ($B = 100 ; $B < $L ; $B++)
{
$P = $A*$B;
if ( substr($P, 0, 1) == substr($P, (length($P)-1), (length($P))) &&
substr($P, 1, 2) == substr($P, (length($P)-2), (length($P)-1)) &&
substr($P, 2, 3) == substr($P, (length($P)-3), (length($P)-2)) &&
length($P) == 6)
{
print $A, " x " , $B, " = ", $P, "\n";
push @array, $P;
}
}
}
$max = $array[0];
foreach $i (@array[1..$#array])
{
if ($i > $max)
{
$max = $i;
}
}
print "The largest palindrome is " , $max , "\n";