Cody

Problem 42695. Replace secondary diagonal elements of a square array

Solution 1743118

Submitted on 5 Mar 2019 by Martin C.
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

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))

A = 3 2 1 6 5 4 9 8 7 A = 0 2 1 6 0 4 9 8 0 A = 10 2 1 6 10 4 9 8 10 B = 1 2 10 4 10 6 10 8 9
2   Pass
A = 1; n = 10; B_correct = 10; assert(isequal(sec_diag_replacement(A,n),B_correct))

A = 1 A = 0 A = 10 B = 10
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))

A = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 A = 0 1 1 1 1 0 1 1 1 1 0 1 1 1 1 0 A = 0 1 1 1 1 0 1 1 1 1 0 1 1 1 1 0 B = 1 1 1 0 1 1 0 1 1 0 1 1 0 1 1 1
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))

A = 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 A = 0 0 0 1 0 0 1 0 0 1 0 0 1 0 0 0 A = 10 0 0 1 0 10 1 0 0 1 10 0 1 0 0 10 B = 1 0 0 10 0 1 10 0 0 10 1 0 10 0 0 1
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))

A = 1 2 1 1 1 1 2 1 1 1 1 2 2 1 1 1 A = 0 2 1 1 1 0 2 1 1 1 0 2 2 1 1 0 A = 3 2 1 1 1 3 2 1 1 1 3 2 2 1 1 3 B = 1 1 2 3 1 2 3 1 2 3 1 1 3 1 1 2
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))

A = 0 0 0 0 0 0 0 0 0 A = 0 0 0 0 0 0 0 0 0 A = -1 0 0 0 -1 0 0 0 -1 B = 0 0 -1 0 -1 0 -1 0 0

Suggested Problems