This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
l = 1;
ar = 2;
y_correct = pi*2;
assert(isequal(Pillar_Size(l,ar),y_correct))
|
2 | Pass |
l = 12;
ar = 25;
y_correct = pi*3600;
assert(isequal(Pillar_Size(l,ar),y_correct))
|
3 | Pass |
l = 6;
ar = 2;
y_correct = pi*72;
assert(isequal(Pillar_Size(l,ar),y_correct))
|
Find the longest sequence of 1's in a binary sequence.
2441 Solvers
Back to basics 6 - Column Vector
809 Solvers
Create a square matrix of multiples
330 Solvers
"Low : High - Low : High - Turn around " -- Create a subindices vector
262 Solvers
172 Solvers