-
Notifications
You must be signed in to change notification settings - Fork 275
/
ChairsRequirement.cpp
46 lines (42 loc) · 1.53 KB
/
ChairsRequirement.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
// Chef's coding class is very famous in Chefland.
// This year X students joined his class and each student will require one chair to sit on. Chef already has Y chairs in his class. Determine the minimum number of new chairs Chef must buy so that every student is able to get one chair to sit on.
// Input Format
// The first line contains a single integer T — the number of test cases. Then the test cases follow.
// The first and only line of each test case contains two integers X and Y — the number of students in the class and the number of chairs Chef already has.
// Output Format
// For each test case, output the minimum number of extra chairs Chef must buy so that every student gets one chair.
// Constraints
// 1≤T≤1000
// 0≤X,Y≤100
// Sample Input 1
// 4
// 20 14
// 41 41
// 35 0
// 50 100
// Sample Output 1
// 6
// 0
// 35
// 0
// Explanation
// Test case 1: There are 20 students in the class and Chef has 14 chairs already. Therefore Chef must buy 6 more chairs.
// Test case 2: There are 41 students in the class and Chef already has exactly 41 chairs. Therefore Chef does not need to buy any more chairs.
// Test case 3: There are 35 students in the class and Chef has no chairs initially. Therefore Chef must buy 35 chairs.
#include <iostream>
using namespace std;
int main() {
int t;
cin>>t;
while(t--)
{
int x,y;
cin>>x>>y;
if(x>=y)
cout<<(x-y)<<endl;
else
cout<<"0"<<endl;
}
// your code goes here
return 0;
}