Cody

# Problem 793. Combinations without using nchoosek

Solution 2709258

Submitted on 18 Jul 2020 by Rafael S.T. Vieira
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 = 3; y_correct = nchoosek(1:n,2); assert(isequal(your_fcn_name(n),y_correct)) % Prevents cheating filetext = fileread('your_fcn_name.m') assert(isempty(strfind(filetext, 'nchoosek')))

filetext = 'function output = your_fcn_name(n) output = []; n = 1:n; for i=1:numel(n) for j=i+1:numel(n) output = [output; n(i), n(j)]; end end end %This code written by profile_id 17355128 '

2   Pass
n = 25; y_correct = nchoosek(1:n,2); assert(isequal(your_fcn_name(n),y_correct)) filetext = fileread('your_fcn_name.m') assert(isempty(strfind(filetext, 'nchoosek')))

filetext = 'function output = your_fcn_name(n) output = []; n = 1:n; for i=1:numel(n) for j=i+1:numel(n) output = [output; n(i), n(j)]; end end end %This code written by profile_id 17355128 '

3   Pass
n = 112; y_correct = nchoosek(1:n,2); assert(isequal(your_fcn_name(n),y_correct)) filetext = fileread('your_fcn_name.m') assert(isempty(strfind(filetext, 'nchoosek')))

filetext = 'function output = your_fcn_name(n) output = []; n = 1:n; for i=1:numel(n) for j=i+1:numel(n) output = [output; n(i), n(j)]; end end end %This code written by profile_id 17355128 '

4   Pass
n = 2 y_correct = nchoosek(1:n,2); assert(isequal(your_fcn_name(n),y_correct)) filetext = fileread('your_fcn_name.m') assert(isempty(strfind(filetext, 'nchoosek')))

n = 2 filetext = 'function output = your_fcn_name(n) output = []; n = 1:n; for i=1:numel(n) for j=i+1:numel(n) output = [output; n(i), n(j)]; end end end %This code written by profile_id 17355128 '