Who Has the Most Change?
Return the 3n+1 sequence for n
Most nonzero elements in row
Sum of combinations
Unique: Faster for options 'rows' and 'stable' for large array of uint8
Elastic Collision 001: 1-D
GJam 2013 China Event: Happy Teams
Minimum Distance Point to Segment
Play Tic Tac Toe : No Losses Allowed
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