Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
check = 1;
while check == 1
D1 = round(rand(1,1)*4+1);
D2 = round(rand(1,1)*4+1);
D3 = round(rand(1,1)*4+1);
draw = sort([D1 D2 D3]);
if size(unique(draw), 2) == 3
check = 0;
end
end
assert(isequal(sort(lottery()),draw))
|
Find the longest sequence of 1's in a binary sequence.
3370 Solvers
1600 Solvers
Project Euler: Problem 4, Palindromic numbers
245 Solvers
Make one big string out of two smaller strings
1149 Solvers
351 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!