Cody

Solution 2273771

Submitted on 12 May 2020 by yuta nakamura
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
x =[ 1 2 3; 4 5 6; 7 8 9]; y_correct = [1 2 6;4 20 120; 7 56 504]; assert(isequal(MatMultiply(x),y_correct))

s = 3 n_i = 1 1 1 n_buf = 3×0 empty double matrix m_i = 1 4 7 n_i = 1 4 7 n = 1 4 7 n_buf = 1 4 7 m_i = 2 5 8 n_i = 2 20 56 n = 1 2 4 20 7 56 n_buf = 1 2 4 20 7 56 m_i = 3 6 9 n_i = 6 120 504 n = 1 2 6 4 20 120 7 56 504 n_buf = 1 2 6 4 20 120 7 56 504

2   Pass
x =reshape([1:10], 2,5); y_correct = [ 1 3 15 105 945; 2 8 48 384 3840;]; assert(isequal(MatMultiply(x),y_correct))

s = 5 n_i = 1 1 n_buf = 2×0 empty double matrix m_i = 1 2 n_i = 1 2 n = 1 2 n_buf = 1 2 m_i = 3 4 n_i = 3 8 n = 1 3 2 8 n_buf = 1 3 2 8 m_i = 5 6 n_i = 15 48 n = 1 3 15 2 8 48 n_buf = 1 3 15 2 8 48 m_i = 7 8 n_i = 105 384 n = 1 3 15 105 2 8 48 384 n_buf = 1 3 15 105 2 8 48 384 m_i = 9 10 n_i = 945 3840 n = 1 3 15 105 945 2 8 48 384 3840 n_buf = 1 3 15 105 945 2 8 48 384 3840

3   Pass
x =eye(5); y_correct = [ 1 0 0 0 0; 0 0 0 0 0; 0 0 0 0 0; 0 0 0 0 0; 0 0 0 0 0;]; assert(isequal(MatMultiply(x),y_correct))

s = 5 n_i = 1 1 1 1 1 n_buf = 5×0 empty double matrix m_i = 1 0 0 0 0 n_i = 1 0 0 0 0 n = 1 0 0 0 0 n_buf = 1 0 0 0 0 m_i = 0 1 0 0 0 n_i = 0 0 0 0 0 n = 1 0 0 0 0 0 0 0 0 0 n_buf = 1 0 0 0 0 0 0 0 0 0 m_i = 0 0 1 0 0 n_i = 0 0 0 0 0 n = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 n_buf = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m_i = 0 0 0 1 0 n_i = 0 0 0 0 0 n = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 n_buf = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 m_i = 0 0 0 0 1 n_i = 0 0 0 0 0 n = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 n_buf = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0

4   Pass
x =ones(7); y_correct = ones(7); assert(isequal(MatMultiply(x),y_correct))

s = 7 n_i = 1 1 1 1 1 1 1 n_buf = 7×0 empty double matrix m_i = 1 1 1 1 1 1 1 n_i = 1 1 1 1 1 1 1 n = 1 1 1 1 1 1 1 n_buf = 1 1 1 1 1 1 1 m_i = 1 1 1 1 1 1 1 n_i = 1 1 1 1 1 1 1 n = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n_buf = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m_i = 1 1 1 1 1 1 1 n_i = 1 1 1 1 1 1 1 n = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n_buf = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m_i = 1 1 1 1 1 1 1 n_i = 1 1 1 1 1 1 1 n = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n_buf = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m_i = 1 1 1 1 1 1 1 n_i = 1 1 1 1 1 1 1 n = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n_buf = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m_i = 1 1 1 1 1 1 1 n_i = 1 1 1 1 1 1 1 n = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n_buf = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 m_i = 1 1 1 1 1 1 1 n_i = 1 1 1 1 1 1 1 n = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 n_buf = 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1