Hiring process8 levels
  1. 1 IQ Test
  2. 2 Additional Online Test (If Required)
  3. 3 Office Interview with Hiring Manager
  4. 4 Unpaid Test Task (Motivation Check)
  5. 5 Paid Test Task and Follow-Up Interview
  6. 6 Iterative Paid Test Tasks
  7. 7 Office Verification
  8. 8 Final Interview with the Founder

Problems > Binomial Coefficient

Binomial Coefficient

Difficulty: 1500 2000 ms 128 MB

math combinatorics

Compute C(N, K) — the number of ways to choose K items from N — modulo 109+7.

Input: one line with two integers N and K.

Output: C(N, K) mod 109+7.

Constraints:

  • 0 ≤ K ≤ N ≤ 2×105

Sample Tests

Input 1
5 2
Output 1
10
Input 2
10 0
Output 2
1

Read the Editorial Statistics

Discussion (opens after you solve — no spoilers before)

No comments yet.

Submit Your Solution

Log in or create a free account to run and submit code.
Ctrl+Enter submit · Ctrl+Space autocomplete · F11 fullscreen