Cody

Problem 793. Combinations without using nchoosek

Solution 1923739

Submitted on 6 Sep 2019 by Martin Vatshelle
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) m = n*(n-1)/2; output = nan(m,2); k=1; for(i=1:n) for(j=i+1:n) output(k,1)=i; output(k,2)=j; k=k+1; end end end %This code written by profile_id 5240032 '

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) m = n*(n-1)/2; output = nan(m,2); k=1; for(i=1:n) for(j=i+1:n) output(k,1)=i; output(k,2)=j; k=k+1; end end end %This code written by profile_id 5240032 '

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) m = n*(n-1)/2; output = nan(m,2); k=1; for(i=1:n) for(j=i+1:n) output(k,1)=i; output(k,2)=j; k=k+1; end end end %This code written by profile_id 5240032 '

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) m = n*(n-1)/2; output = nan(m,2); k=1; for(i=1:n) for(j=i+1:n) output(k,1)=i; output(k,2)=j; k=k+1; end end end %This code written by profile_id 5240032 '

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!