Cody

Problem 7. Column Removal

Solution 827960

Submitted on 15 Feb 2016
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

This solution is outdated. To rescore this solution, sign in.

Test Suite

Test Status Code Input and Output
1   Fail
%% A = [1 2 3; 4 5 6]; n = 2; B_correct = [1 3; 4 6]; assert(isequal(column_removal(A,n),B_correct))

B = 0 0 0 0 piyo = 1 B = 1 0 0 0 piyo = 2 piyo = 3 piyo = 1 B = 1 0 4 0 piyo = 2 piyo = 3

Assertion failed.

2   Fail
%% A = magic(4); n = 3; B = [16 2 13; 5 11 8; 9 7 12; 4 14 1]; B_correct = B; assert(isequal(column_removal(A,n),B_correct))

B = 0 0 0 0 0 0 0 0 0 0 0 0 piyo = 1 B = 16 0 0 0 0 0 0 0 0 0 0 0 piyo = 2 B = 16 2 0 0 0 0 0 0 0 0 0 0 piyo = 3 piyo = 4 piyo = 1 B = 16 2 0 5 0 0 0 0 0 0 0 0 piyo = 2 B = 16 2 0 5 11 0 0 0 0 0 0 0 piyo = 3 piyo = 4 piyo = 1 B = 16 2 0 5 11 0 9 0 0 0 0 0 piyo = 2 B = 16 2 0 5 11 0 9 7 0 0 0 0 piyo = 3 piyo = 4 piyo = 1 B = 16 2 0 5 11 0 9 7 0 4 0 0 piyo = 2 B = 16 2 0 5 11 0 9 7 0 4 14 0 piyo = 3 piyo = 4

Assertion failed.

3   Fail
%% A = 1:10; n = 7; B_correct = [1 2 3 4 5 6 8 9 10]; assert(isequal(column_removal(A,n),B_correct))

B = 0 0 0 0 0 0 0 0 0 piyo = 1 B = 1 0 0 0 0 0 0 0 0 piyo = 2 B = 1 2 0 0 0 0 0 0 0 piyo = 3 B = 1 2 3 0 0 0 0 0 0 piyo = 4 B = 1 2 3 4 0 0 0 0 0 piyo = 5 B = 1 2 3 4 5 0 0 0 0 piyo = 6 B = 1 2 3 4 5 6 0 0 0 piyo = 7 piyo = 8 B = 1 2 3 4 5 6 0 8 0 piyo = 9 B = 1 2 3 4 5 6 0 8 9 piyo = 10

Assertion failed.