Module: (C++) Recursion


Problem

6 /12


Number of combinations

Problem

From the given numbers n and k (0<=k<=n) calculate \(C_n^k\) . Use  \(C_n^k=C_{n-1}^{k-1}+C_{n-1}^k\) to solve.

Write the solution as a function C(n, k).

Input: Integers n and k are entered.
Output: Output the answer to the problem.

Examples
# Input Output
1 4
2		 6

time 1000 ms
memory 256 Mb
Rules for program design and list of errors in automatic problem checking

Teacher commentary

Your Program

Attach a file with the source code of the program:

or select a programming language and type your program

Auto

       

Program check result To check the solution of the problem, you need to register or log in!