Cody

Problem 793. Combinations without using nchoosek

Solution 1937571

Submitted on 15 Sep 2019 by Sean Kavanagh
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

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 = zeros(n*(n-1)/2, 2); row = 0; for a = 1:(n-1) for b = (a+1):n row = row + 1; output(row, :) = [a, b]; end end end %This code written by profile_id 3154045 '
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 = zeros(n*(n-1)/2, 2); row = 0; for a = 1:(n-1) for b = (a+1):n row = row + 1; output(row, :) = [a, b]; end end end %This code written by profile_id 3154045 '
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 = zeros(n*(n-1)/2, 2); row = 0; for a = 1:(n-1) for b = (a+1):n row = row + 1; output(row, :) = [a, b]; end end end %This code written by profile_id 3154045 '
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 = zeros(n*(n-1)/2, 2); row = 0; for a = 1:(n-1) for b = (a+1):n row = row + 1; output(row, :) = [a, b]; end end end %This code written by profile_id 3154045 '

Suggested Problems

More from this Author30