Cody

Problem 793. Combinations without using nchoosek

Solution 2867180

Submitted on 22 Aug 2020 by Ramesh Kumar V
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 y = your_fcn_name(n1) x=1:n1-1 ; m=length(x) ; n=max(x) ; y=[] ; for i=1:m for j=i:m a=i ; b=j+1 ; z= [a b] ; y=[y ;z] ; end end %This code written by profile_id 16216018 '

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 y = your_fcn_name(n1) x=1:n1-1 ; m=length(x) ; n=max(x) ; y=[] ; for i=1:m for j=i:m a=i ; b=j+1 ; z= [a b] ; y=[y ;z] ; end end %This code written by profile_id 16216018 '

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 y = your_fcn_name(n1) x=1:n1-1 ; m=length(x) ; n=max(x) ; y=[] ; for i=1:m for j=i:m a=i ; b=j+1 ; z= [a b] ; y=[y ;z] ; end end %This code written by profile_id 16216018 '

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 y = your_fcn_name(n1) x=1:n1-1 ; m=length(x) ; n=max(x) ; y=[] ; for i=1:m for j=i:m a=i ; b=j+1 ; z= [a b] ; y=[y ;z] ; end end %This code written by profile_id 16216018 '


Community Treasure Hunt

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

Start Hunting!