Page Contents

**The Cooler Dilemma 2 WATERCOOLER2** **Solution**

The summer is at its peak in Chefland. Chef is planning to purchase a water cooler to keep his room cool. He has two options available:

Rent a cooler at the cost of X coins per month.

Purchase a cooler for Y coins.

Chef wonders what is the maximum number of months for which he can rent the cooler such that the cost of renting is strictly less than the cost of purchasing it.

Input Format

The first line of input will contain an integer T — the number of test cases. The description of T test cases follows.

The first and only line of each test case contains two integers X and Y, as described in the problem statement.

Output Format

For each test case, output the maximum number of months for which he can rent the cooler such that the cost of renting is strictly less than the cost of purchasing it.

If Chef should not rent a cooler at all, output 0.

Constraints

1≤T≤1000

1≤X,Y≤109

Sample Input 1

2

5 12

5 5

Sample Output 1

2

0

Explanation

Test case 1: Cost of renting the cooler =5 coins per month. Cost of purchasing the cooler =12 coins. So, Chef can rent the cooler for 2 months at the cost of 10 coins, which is strictly less than 12 coins.

Test case 2: Cost of renting the cooler =5 coins per month. Cost of purchasing the cooler =5 coins. If Chef rents the cooler for 1 month, it will cost 5 coins, which is not strictly less than the cost of purchasing it. So, Chef should not rent the cooler.

**SOLUTION**

**Program:** **The Cooler Dilemma 2 WATERCOOLER2** **Solution** in Python

for _ in range (int(input())): x,y = map(int, input().split()) if (y>x): z = y - 1 r = int(z/x) print(r) else: print("0")

**Program:** **The Cooler Dilemma 2 WATERCOOLER2** **Solution** in C++

#include <iostream> #include <iomanip> using namespace std; int main() { int t,x,y,m; cin>>t; while(t--){ cin>>x>>y; m = (y/x); if (y%x==0){ m = ((y/x)-1); } cout<<m<<endl; } return 0; }

**Program:** **The Cooler Dilemma 2 WATERCOOLER2** **Solution** in Java

import java.util.*; import java.lang.*; import java.io.*; class Codechef { public static void main (String[] args) throws java.lang.Exception { Scanner sc=new Scanner(System.in); int t=sc.nextInt(); while(t-->0){ int x=sc.nextInt(); int y=sc.nextInt(); if(y%x==0){ System.out.println((y/x)-1); } else{ System.out.println(y/x); } } } }

**Related:**

*Dazzling AXNODR Challenge AXNODR Codechef Solution**Dazzling GCD Pair NOTUNIT Solution**The Cooler Dilemma 2 WATERCOOLER2 Solution**The Cooler Dilemma 1 WATERCOOLER1 Solution**Ezio and Guards MANIPULATE Codechef Solution**Pairwise Xors XORABC Codechef Solution**Prime Sum PRIMESM Codechef Solution*