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)
|
Project Euler: Problem 10, Sum of Primes
707 Solvers
Find the sum of the elements in the "second" diagonal
994 Solvers
249 Solvers
Getting the indices from a matrice
360 Solvers
Check that number is whole number
1070 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!