Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x1 = zeros(1,6000);
x2 = zeros(1,6000);
for ii = 1:6000
[x1(ii),x2(ii)] = rollDice();
end
numCt = sum( bsxfun( @eq, x1, (1:6)' ), 2 ) + sum( bsxfun( @eq, x2, (1:6)' ), 2 );
assert(all(round(numCt/200) == 10) && sum(numCt) == 12000)
|
Find the alphabetic word product
2321 Solvers
Find the two most distant points
1628 Solvers
379 Solvers
266 Solvers
306 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!