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].
Given a window, how many subsets of a vector sum positive
Make a 1 hot vector
Is the paranthesis sequence balanced ?
Add two numbers
Length of a short side
Unique: Enhanced Performance - Avoiding Memory Crash
Minimum Distance Point to Segment
GJam 2016 Rd1A: Rank and File (Large)
PACMAT - G03 Ghosts use minimum path to PACMAT; 3 Lives
Usage of varargout
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