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 |
x = 2;
n_correct = 5;
assert(isequal(bigNumRepeat(x),n_correct))
|
2 | Pass |
x = 10;
n_correct = inf;
assert(isequal(bigNumRepeat(x),n_correct))
|
3 | Pass |
x = [3 7 33 51 67 192 329 678 680 4731 10016 10081 35197 35199 51783 517839 517842];
n_correct = [5 5 21 3 21 101 51 inf inf 501 626 626 5001 251 2501 12501 inf];
for ii = 1:numel(x)
assert(isequal(bigNumRepeat(x(ii)),n_correct(ii)))
end
|
747 Solvers
198 Solvers
153 Solvers
299 Solvers
Number of 1s in a binary string
1234 Solvers