Problem 235. Project Euler: Problem 4, Palindromic numbers
Your last test case is accidentally all commented out, so isn't a real test case
The question is unclear. Do the factor-numbers all have to be two-digited?
@Jan-Andrea Bard, no.
Although it is not mentioned clearly in the problem statement but you can see a hint from the test suite
Sorry for cheating but I couldn't find a solution that doesn't crash the servers
A double for loop that performs a brute force scan from x down to 0.9*x in each loop - doesn't crash the servers :)
hi, my cod gives me true ans but its worked too slow because of for loop but could not figure it out without for loop. could u send me our code or check mines ? function u = euler004(n)
function L = ispalindrome(n)
if str2double(s(i)) == str2double(s(l-i+1))
can anyone explain what is meaning of products of two inputs ,here input is only one number ,does it mean the square of input
More like exploiting the limited test suite by hard coding. The test suite has been updated now.
Thanks for the note Aurelien. I added to the test suite.
the largest palindrome made from the product of 9999 is 99977999， not 99000099！
and x=999，y=997799, not 906609.
x=2500, y=6249246, not 6167616
x=100, y=999, not 9009
zd c, 99977999 cannot be written as the product of two numbers less than or equal to 9999.
Problem Recent Solvers766
Find nearest prime number less than input number
Sum of odd numbers in a matrix
Find the Oldest Person in a Room
More from this Author51
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!