Sherlock and Permutations
1 min read

Sherlock and Permutations

Sherlock and Permutations

Watson asks Sherlock:
Given a string S of N 0's and M 1's, how many unique permutations of this string start with 1?

Help Sherlock by printing the answer modulo (109+7).

Input Format
First line contains T, the number of test cases.
Each test case consists of N and M separated by a space.

Output Format
For each test case, print the answer modulo (109+7).

1 ≤ T ≤ 200
1 ≤ N,M ≤ 1000

Sample Input

1 1
2 3

Sample Output


Test1: Out of all unique permutations ie. 01 and 10, only second permutation satisfies. Hence, output is 1.
Test2: Out of all unique permutations ie. 00111 01011 01101 01110 10011 10101 10110 11001 11010 11100, only 10011 10101 10110 11001 11010 11100 satisfy. Hence, output is 6.

Solution in Python


import os
import sys

def facdiv(m,n):
    p = 1
    for i in range(m+1,n+1):
    return p

def solve(n, m):
    n,m = nums
    answer = facdiv(m,m+n) //facdiv(0,n)
    return int(answer%(10**9+7))

for _ in range(int(input())):
    n,m = list(map(int,input().split()))

Enjoying these posts? Subscribe for more

Adblocker detected! Please consider reading this notice.

We've detected that you are using AdBlock Plus or some other adblocking software which is preventing the page from fully loading.

That's okay. But without advertising-income, we can't keep making this site awesome.

We don't have any banner, Flash, animation, obnoxious sound, or popup ad. We do not implement these annoying types of ads!

We need money to operate the site, and almost all of it comes from our online advertising.

Please add to your ad blocking whitelist or disable your adblocking software.