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].
Determine if a Given Number is a Triangle Number
Duplicate each element of a vector.
Sum the Digits of a Number
Numbers in extended form
GJam: 2013 China Event: Cannon Angle
Image Processing 004: Zernike Coefficients
Reading Web Binary Files (jpg,pdf,tiff,png)
GJam 2014 China Rd A: Library Sorting (Large)
USC Spring 2013 ACM: Relief Supplies
GJam 2017 Kickstart: Vote (Small)
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