Cody

Problem 793. Combinations without using nchoosek

Solution 677252

Submitted on 29 May 2015 by bainhome
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 ans = your_fcn_name(n) tril(kron((2:n)',ones(1,n-1))); t=tril(repelem(1:n-1,n-1,1)); [t(t~=0),ans(ans~=0)]; end %This code written by profile_id 4188719

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 ans = your_fcn_name(n) tril(kron((2:n)',ones(1,n-1))); t=tril(repelem(1:n-1,n-1,1)); [t(t~=0),ans(ans~=0)]; end %This code written by profile_id 4188719

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 ans = your_fcn_name(n) tril(kron((2:n)',ones(1,n-1))); t=tril(repelem(1:n-1,n-1,1)); [t(t~=0),ans(ans~=0)]; end %This code written by profile_id 4188719

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 ans = your_fcn_name(n) tril(kron((2:n)',ones(1,n-1))); t=tril(repelem(1:n-1,n-1,1)); [t(t~=0),ans(ans~=0)]; end %This code written by profile_id 4188719

Suggested Problems

More from this Author30

Community Treasure Hunt

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

Start Hunting!