I am sure there are other more subtle ways to go about it but this seems about as fast as I can make it for a general brute-force solution (0.11s)
This one seems to work for the large test case, too, although it is not a general solution [for size(p,1)>100 it only tests corner points].
Filter AC, pass DC
Project Euler: Problem 4, Palindromic numbers
How to add?
Combinations without using nchoosek
GJam 2013 China Event: Happy Teams 100 Pairs
Access a web hosted copy of the Tiles Contest MAT file
PACMAT - Ghosts Random; 3 Lives
Gene Sequence Contest: Retro
Factorial: Unlimited Size : java.math
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office