This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
A = [1 2 3; 4 5 6; 7 8 9];
n = 10;
B_correct = [1 2 10; 4 10 6; 10 8 9];
assert(isequal(sec_diag_replacement(A,n),B_correct))
|
2 | Pass |
A = 1;
n = 10;
B_correct = 10;
assert(isequal(sec_diag_replacement(A,n),B_correct))
|
3 | Pass |
A = ones(4);
n = 0;
B_correct = [1 1 1 0; 1 1 0 1; 1 0 1 1; 0 1 1 1];
assert(isequal(sec_diag_replacement(A,n),B_correct))
|
4 | Pass |
A = eye(4);
n = 10;
B_correct = [1 0 0 10; 0 1 10 0; 0 10 1 0; 10 0 0 1];
assert(isequal(sec_diag_replacement(A,n),B_correct))
|
5 | Pass |
A = [1 1 2 1; 1 2 1 1; 2 1 1 1; 1 1 1 2];
n = 3;
B_correct = [1 1 2 3; 1 2 3 1; 2 3 1 1; 3 1 1 2];
assert(isequal(sec_diag_replacement(A,n),B_correct))
|
6 | Pass |
A = zeros(3);
n = -1;
B_correct = [0 0 -1; 0 -1 0; -1 0 0];
assert(isequal(sec_diag_replacement(A,n),B_correct))
|
Project Euler: Problem 1, Multiples of 3 and 5
1492 Solvers
171 Solvers
Check that number is whole number
1070 Solvers
232 Solvers
Create sequnce 1 4 9 16 25.........
190 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!