Scribd
Upload
34 views1 page

Problem T. Marbles: 440 Ms Linux

Rohit dreamed he was in a shop with infinitely many marbles of k different colors to choose n marbles from. He wants at least one of each color but there are many possibilities. The input provides the number of test cases T, then for each case the number of marbles n Rohit can choose and number of colors k. The output should print the number of possibilities Rohit had to choose the marbles.

Uploaded by

Gilson Bravo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
34 views1 page

Problem T. Marbles: 440 Ms Linux

Rohit dreamed he was in a shop with infinitely many marbles of k different colors to choose n marbles from. He wants at least one of each color but there are many possibilities. The input provides the number of test cases T, then for each case the number of marbles n Rohit can choose and number of colors k. The output should print the number of possibilities Rohit had to choose the marbles.

Uploaded by

Gilson Bravo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Pratica 01-Instic training  

  Nov 08, 2022

Problem T. Marbles
Time limit 440 ms
Code length Limit 10000 B
OS Linux

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 Format

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.

Output Format

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.

Constraints

1<=k<=n<=1000000

Sample 1
Input Output

2
1

10 10 475020

30 7

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy