Cody

Problem 44241. NCHOOSEK - Time Optimization

Input

  • V —— Set of all choices, a vector of N, 1 < N < 100
  • K —— Number of selected choices, a scalar, 0 <= K <= N

Outout

  • C —— All combinations of V, equivalent to nchoosek(V, K)

Scoring

Time consumed

Solution Stats

61.9% Correct | 38.1% Incorrect
Last solution submitted on Oct 09, 2019

Problem Comments


Problem Recent Solvers10