Marbles


Problem Statement :


Rohit dreams he is in a shop with an infinite amount of marbles. He is allowed to select n marbles. There are marbles of k different colors. From each color there are also infinitely many marbles. Rohit wants to have at least one marble of each color, but still there are a lot of possibilities for his selection. In his effort to make a decision he wakes up. Now he asks you how many possibilities for his selection he would have had. Assume that marbles of equal color can't be distinguished, and the order of the marbles is irrelevant.

Input

The first line of input contains a number T <= 100 that indicates the number of test cases to follow. Each test case consists of one line containing n and k, where n is the number of marbles Rohit selects and k is the number of different colors of the marbles. You can assume that 1<=k<=n<=1000000.

Output

For each test case print the number of possibilities that Rohit would have had. You can assume that this number fits into a signed 64 bit integer.

Example

Input:

2
10 10
30 7

Output:

1
475020


Solution :



title-img 


                            Solution in C :

#include <stdio.h>
int main()
{
	int t;
	scanf("%d",&t);
	while(t--)
	{
		long long int n,k;scanf("%lld %lld",&n,&k);
		long long int d=n-k,sum=1;
		if(n==k) {
		sum=1;
		}
		else
		{
			for(long long int i=1;i<k;i++)
			{
				sum=sum*(d+i);
				sum=sum/i;
			}
		}
		printf("%lld\n",sum);
	}
	return 0;
}
                        


                        Solution in C++ :

#include<bits/stdc++.h>
using namespace std;

#define ll long long 
#define  ld long double 
#define vl vector<ll> 
#define vi vector<int> 
#define vs vector<string> 
#define vvl vector<vl> 
#define vvvl vector<vvl> 
#define  vvs vector<vs> 
#define   vvi vector<vi> 
#define  vs vector<string> 
#define  vvs vector<vs>
using namespace std;


ll comb(ll n, ll k){
    ll ans = 1;
    if (2*k > n) k = n-k;

    for(ll i=1; i<=k; i++){
        ans *= n;
        ans /= i;
        n--;
    }

    return ans;
}

void solve(){
    ll n,k; cin>>n>>k;

    cout << comb(n-1, k-1) << endl;
}


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll t; 
    cin>>t;
   while(t--)
        solve();
    
    return 0;
}
                    


                        Solution in Java :

/* package codechef; // don't place package name! */

import java.util.*;
import java.lang.*;
import java.io.*;

/* Name of the class has to be "Main" only if the class is public. */
class Codechef
{
    public static long fact(int n)
    {
        long res=0;
        if(n==1||n==0)
        {
            res= 1;
        }
        else{
            res =  n*fact(n-1);
        }
        return res;
    }
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
		int n,k,t;
		long poss;
		Scanner sc = new Scanner(System.in);
		t = sc.nextInt();
		while(t>0)
		{
		    t--;
		    n = sc.nextInt();
		    k = sc.nextInt();
		    if(n==k)
		    {
		        poss =1;
		    }
		    else 
		    {
		        int m = n-k; poss = 1;
		        for(int i=1;i<k;i++)
		        {
		            poss = poss*(m+i)/i;
		        }
		    }
		    System.out.println(poss);
		}
	}
}
                    


                        Solution in Python : 
                            
n=int(input())
for i in range(n):
    n,b=map(int,input().split())
    r1=1
    for i in range(1,b):
        r1=r1*(n-b+i)//(i)
    print(int(r1))


View More Similar Problems

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →

Polynomial Division

Consider a sequence, c0, c1, . . . , cn-1 , and a polynomial of degree 1 defined as Q(x ) = a * x + b. You must perform q queries on the sequence, where each query is one of the following two types: 1 i x: Replace ci with x. 2 l r: Consider the polynomial and determine whether is divisible by over the field , where . In other words, check if there exists a polynomial with integer coefficie

View Solution →

Costly Intervals

Given an array, your goal is to find, for each element, the largest subarray containing it whose cost is at least k. Specifically, let A = [A1, A2, . . . , An ] be an array of length n, and let be the subarray from index l to index r. Also, Let MAX( l, r ) be the largest number in Al. . . r. Let MIN( l, r ) be the smallest number in Al . . .r . Let OR( l , r ) be the bitwise OR of the

View Solution →

The Strange Function

One of the most important skills a programmer needs to learn early on is the ability to pose a problem in an abstract way. This skill is important not just for researchers but also in applied fields like software engineering and web development. You are able to solve most of a problem, except for one last subproblem, which you have posed in an abstract way as follows: Given an array consisting

View Solution →

Self-Driving Bus

Treeland is a country with n cities and n - 1 roads. There is exactly one path between any two cities. The ruler of Treeland wants to implement a self-driving bus system and asks tree-loving Alex to plan the bus routes. Alex decides that each route must contain a subset of connected cities; a subset of cities is connected if the following two conditions are true: There is a path between ever

View Solution →

Unique Colors

You are given an unrooted tree of n nodes numbered from 1 to n . Each node i has a color, ci. Let d( i , j ) be the number of different colors in the path between node i and node j. For each node i, calculate the value of sum, defined as follows: Your task is to print the value of sumi for each node 1 <= i <= n. Input Format The first line contains a single integer, n, denoti

View Solution →