Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = 1;
G_correct = [1 2 3; 8 8 8; 7 8 9];
assert(isequal(your_fcn_name(x),G_correct))
|
Number of 1s in the Binary Representation of a Number
319 Solvers
Project Euler: Problem 2, Sum of even Fibonacci
461 Solvers
Back to basics 11 - Max Integer
611 Solvers
Rounding off numbers to n decimals
282 Solvers
207 Solvers