Cody

# Problem 793. Combinations without using nchoosek

Solution 106350

Submitted on 4 Jul 2012 by Freddy
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 M = your_fcn_name(n) M = zeros(n*(n-1)/2,2); k = 1; for i = 1:n for j=i+1:n M(k,:) = [i j]; k = k + 1; end end %This code written by profile_id 3334064

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 M = your_fcn_name(n) M = zeros(n*(n-1)/2,2); k = 1; for i = 1:n for j=i+1:n M(k,:) = [i j]; k = k + 1; end end %This code written by profile_id 3334064

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 M = your_fcn_name(n) M = zeros(n*(n-1)/2,2); k = 1; for i = 1:n for j=i+1:n M(k,:) = [i j]; k = k + 1; end end %This code written by profile_id 3334064

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 M = your_fcn_name(n) M = zeros(n*(n-1)/2,2); k = 1; for i = 1:n for j=i+1:n M(k,:) = [i j]; k = k + 1; end end %This code written by profile_id 3334064