This solution is outdated. To rescore this solution, sign in.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
assert(isequal(ecount(1:10,2),1))
|
2 | Pass |
assert(isequal(ecount([1 1 1 1 1 1 1 1],1),8))
|
3 | Pass |
assert(isequal(ecount([1 1 1 1 1 1 1 1],2),0))
|
4 | Pass |
assert(isequal(ecount([1 1 1 1 NaN NaN 1 1],NaN),2))
|
5 | Pass |
assert(isequal(ecount([15 13 6 2 71 -5 -7 15],15),2))
|
Project Euler: Problem 2, Sum of even Fibonacci
459 Solvers
Matrix indexing with two vectors of indices
405 Solvers
Rotate input square matrix 90 degrees CCW without rot90
304 Solvers
Change the sign of even index entries of the reversed vector
212 Solvers
213 Solvers