**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 :

` ````
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

## Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

View Solution →## Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

View Solution →## Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →## Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →## Tree Coordinates

We consider metric space to be a pair, , where is a set and such that the following conditions hold: where is the distance between points and . Let's define the product of two metric spaces, , to be such that: , where , . So, it follows logically that is also a metric space. We then define squared metric space, , to be the product of a metric space multiplied with itself: . For

View Solution →## Array Pairs

Consider an array of n integers, A = [ a1, a2, . . . . an] . Find and print the total number of (i , j) pairs such that ai * aj <= max(ai, ai+1, . . . aj) where i < j. Input Format The first line contains an integer, n , denoting the number of elements in the array. The second line consists of n space-separated integers describing the respective values of a1, a2 , . . . an .

View Solution →