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].
Distance walked 3D
Getting the indices from a vector
Make a 1 hot vector
Coin change combinations.
R2012b atan in Degrees
Genome Sequence 003: DNA Sequence with random positioned segments
Vectorize the digits of an Integer
Is 3D point set Co-Planar?
Usage of java.math : N Choose K with unlimited precision
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