Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 1;
y_correct = 0;
assert(isequal(primorialTrailingZeros(n),y_correct))
|
2 | Pass |
n = 2;
y_correct = 0;
assert(isequal(primorialTrailingZeros(n),y_correct))
|
3 | Pass |
n = 5;
y_correct = 1;
assert(isequal(primorialTrailingZeros(n),y_correct))
|
4 | Pass |
n = 10;
y_correct = sin((n+3)*pi/2);
assert(isequal(primorialTrailingZeros(n),y_correct))
|
5 | Pass |
n = 100;
y_correct = sum(1./2.^(1:n));
assert(isequal(primorialTrailingZeros(n),y_correct))
|
6 | Pass |
n = 1e4;
y_correct = besselj(mod(n,10),prod(num2str(n)'-'0'));
assert(isequal(primorialTrailingZeros(n),y_correct))
|
7 | Pass |
n = 1e6;
f = [factor(log10(n)) 3 7 7 89];
y_correct = length(primes(n))/prod(f);
assert(isequal(primorialTrailingZeros(n),y_correct))
|
Given an unsigned integer x, find the largest y by rearranging the bits in x
780 Solvers
Check to see if a Sudoku Puzzle is Solved
278 Solvers
128 Solvers
275 Solvers
49 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!