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 longest sequence of 1's in a binary sequence.
2443 Solvers
Swap the first and last columns
9897 Solvers
Determine the number of odd integers in a vector
321 Solvers
263 Solvers
ベクトル [1 2 3 4 5 6 7 8 9 10] の作成
197 Solvers