Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
n = 5;
a = [3 3 3 3 3;
3 2 2 2 3;
3 2 1 2 3;
3 2 2 2 3;
3 3 3 3 3];
assert(isequal(bullseye(n),a));
a =
3 3 3 3 3
3 2 2 2 3
3 2 2 2 3
3 2 2 2 3
3 3 3 3 3
a =
3 3 3 3 3
3 2 2 2 3
3 2 1 2 3
3 2 2 2 3
3 3 3 3 3
|
2 | Pass |
n = 7;
a = [4 4 4 4 4 4 4;
4 3 3 3 3 3 4;
4 3 2 2 2 3 4;
4 3 2 1 2 3 4;
4 3 2 2 2 3 4;
4 3 3 3 3 3 4;
4 4 4 4 4 4 4];
assert(isequal(bullseye(n),a))
a =
4 4 4 4 4 4 4
4 3 3 3 3 3 4
4 3 3 3 3 3 4
4 3 3 3 3 3 4
4 3 3 3 3 3 4
4 3 3 3 3 3 4
4 4 4 4 4 4 4
a =
4 4 4 4 4 4 4
4 3 3 3 3 3 4
4 3 2 2 2 3 4
4 3 2 2 2 3 4
4 3 2 2 2 3 4
4 3 3 3 3 3 4
4 4 4 4 4 4 4
a =
4 4 4 4 4 4 4
4 3 3 3 3 3 4
4 3 2 2 2 3 4
4 3 2 1 2 3 4
4 3 2 2 2 3 4
4 3 3 3 3 3 4
4 4 4 4 4 4 4
|
Project Euler: Problem 3, Largest prime factor
379 Solvers
345 Solvers
Number of digits in an integer
336 Solvers
519 Solvers
464 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!