Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
t1=1; r=1; n=7;
y_correct = 7;
assert(isequal(your_fcn_name(t1,r,n),y_correct))
A =
1
A =
1 1
A =
1 1 1
A =
1 1 1 1
A =
1 1 1 1 1
A =
1 1 1 1 1 1
A =
1 1 1 1 1 1 1
|
2 | Pass |
t1=10; r=10; n=5;
y_correct = 111110;
assert(isequal(your_fcn_name(t1,r,n),y_correct))
A =
10
A =
10 100
A =
10 100 1000
A =
10 100 1000 10000
A =
10 100 1000 10000 100000
|
3 | Pass |
t1=7; r=3; n=5;
y_correct = 847;
assert(isequal(your_fcn_name(t1,r,n),y_correct))
A =
7
A =
7 21
A =
7 21 63
A =
7 21 63 189
A =
7 21 63 189 567
|
Make the vector [1 2 3 4 5 6 7 8 9 10]
29423 Solvers
Find the longest sequence of 1's in a binary sequence.
2440 Solvers
Check to see if a Sudoku Puzzle is Solved
232 Solvers
Find a subset that divides the vector into equal halves
289 Solvers
Find out missing number from a vector of 9 elements
207 Solvers