Given the dimensions of a 2-d plane, create a matrix where a "snake" of ones occupies the plane from top left to bottom right.
Example:
0 0 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 1 0 0 1 1 1 1 1 1 1 1 0 0 1 0 0 0 0 0 0 0 0 0 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0
for m=7, n=10 the m will always be odd and >5 n will be >3
514 Solvers
Return unique values without sorting
419 Solvers
Sum the entries of each column of a matrix which satisfy a logical condition.
102 Solvers
94 Solvers
Penny flipping - calculate winning probability (easy)
107 Solvers
Opportunities for recent engineering grads.
Apply Today