Please enter your email address or userHandle.
Given 2 number n and r, compute nCr mod 109+7.
The first line of input contains an integer T denoting the number of test cases. Then T test cases follow. The first line of each test case contains the integers n and r.
Output nCr mod 109+7 for each test case in a new line.
1 <= T <= 100
1 <= n, r <= 1000
We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?
Login to access your submissions.
Please choose 'ReadOnlyMode' if you needn't to 'Edit' the problem e.g. viewing OJ's solution, TestCase Files (TCFs), TimeLimit etc.