Cody

# Problem 44063. Make a rainbow matrix (follow-up to checkerboard matrix)

Solution 1945088

Submitted on 21 Sep 2019 by Augusto Mazzei
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
n = 2; a_correct = [0 1; 1 0]; assert(isequal(rainBowMatrix(n),a_correct))

ans = 0 1 1 0

2   Pass
n = 3; a_correct = [0 1 2; 1 2 1; 2 1 0]; assert(isequal(rainBowMatrix(n),a_correct))

ans = 0 1 2 1 2 1 2 1 0

3   Pass
n = 4; a_correct = [0 1 2 3; 1 2 3 2; 2 3 2 1; 3 2 1 0]; assert(isequal(rainBowMatrix(n),a_correct))

ans = 0 1 2 3 1 2 3 2 2 3 2 1 3 2 1 0

4   Pass
n = 5; a_correct = [0 1 2 3 4; 1 2 3 4 3; 2 3 4 3 2; 3 4 3 2 1; 4 3 2 1 0]; assert(isequal(rainBowMatrix(n),a_correct))

ans = 0 1 2 3 4 1 2 3 4 3 2 3 4 3 2 3 4 3 2 1 4 3 2 1 0

5   Pass
n = 6; a_correct = [0 1 2 3 4 5; 1 2 3 4 5 4; 2 3 4 5 4 3; 3 4 5 4 3 2; 4 5 4 3 2 1; 5 4 3 2 1 0]; assert(isequal(rainBowMatrix(n),a_correct))

ans = 0 1 2 3 4 5 1 2 3 4 5 4 2 3 4 5 4 3 3 4 5 4 3 2 4 5 4 3 2 1 5 4 3 2 1 0

6   Pass
n = 8; a_correct = [0 1 2 3 4 5 6 7; 1 2 3 4 5 6 7 6; 2 3 4 5 6 7 6 5; 3 4 5 6 7 6 5 4; 4 5 6 7 6 5 4 3; 5 6 7 6 5 4 3 2; 6 7 6 5 4 3 2 1; 7 6 5 4 3 2 1 0]; assert(isequal(rainBowMatrix(n),a_correct))

ans = 0 1 2 3 4 5 6 7 1 2 3 4 5 6 7 6 2 3 4 5 6 7 6 5 3 4 5 6 7 6 5 4 4 5 6 7 6 5 4 3 5 6 7 6 5 4 3 2 6 7 6 5 4 3 2 1 7 6 5 4 3 2 1 0