Savings AccountConsidering the new budget, Chef decided to keep all his money in a savings account.Chef has 𝑋X income sources where he gets 𝑌Y rupees from each source. However, due to bank restrictions, Chef can keep at most 𝑍Z rupees in the savings account.Find the minimum number of income sources Chef should reduce to maximise his savings without exceeding the account's limit.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of three space-separated integers 𝑋,𝑌,X,Y, and 𝑍Z — the number of income sources, amount received from each source and the maximum limit of savings account respectively.Output FormatFor each test case, output on a new line, the minimum number of income sources Chef should reduce to maximise his savings without exceeding the account's limit.Constraints1≤𝑇≤1041≤T≤10 4 1≤𝑋,𝑌≤101≤X,Y≤101≤𝑍≤1001≤Z≤100Sample 1:InputOutput31 2 42 4 63 10 12012Explanation:Test case 11: Chef can store a maximum of 44 rupees in his bank account. He has 11 income source from where he gets 22 rupees. Since the total income is not more than the limit of account, he does not need to decrease any income source.Test case 22: Chef can store a maximum of 66 rupees in his bank account. He has 22 income sources from where he gets 44 rupees each. Currently the total income is more than the limit of account.Chef will reduce one income source so that his total income becomes 44 rupees which lies within the limit of account.

Chef had collected 𝑁N notes of Rs. 20002000 to pay his total college fees. However, the government banned Rs. 20002000 notes.Chef wants to pay the same amount using Rs. 500500 notes only. Find the number of notes Chef needs.Input FormatEach test case consists of a single integer 𝑁N - the number of notes of Rs. 20002000 that Chef has collected.Output FormatOutput a single integer - the number of Rs. 500500 notes needed.Constraints1≤𝑁≤1001≤N≤100Sample 1:InputOutput416Explanation:44 notes of Rs. 20002000 make a total of 4⋅2000=80004⋅2000=8000 rupees. This is equivalent to 1616 notes of Rs. 500500.

On the occasion of Yoga Day, the only yoga instructor in Chefland, Chef, has received numerous queries.Chef has managed to free up 𝑁N hours from his busy schedule to conduct yoga sessions. There are two types of sessions that Chef offers:Type 11 session, which lasts 11 hour, and earns Chef 𝑋X rupees.Type 22 session, which lasts 22 hours, and earns Chef 𝑌 (𝑌>𝑋)Y (Y>X) rupees.Find the maximum amount of money Chef can earn in 𝑁N hours.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of three space-separated integers 𝑁,𝑋,𝑌N,X,Y — the number of hours for which Chef will take yoga sessions, price of type 11 session, and price of type 22 session respectively.Output FormatFor each test case, output on a new line, the maximum amount of money Chef can earn in 𝑁N hours.Constraints1≤𝑇≤10001≤T≤10001≤𝑁≤10001≤N≤10001≤𝑋<𝑌≤1001≤X<Y≤100Sample 1:InputOutput34 5 73 1 25 2 620314Explanation:Test case 11: Chef will take type 11 sessions for all 44 hours. Thus, in 44 hours, he can take 44 sessions earning a total of 4⋅5=204⋅5=20 rupees.Test case 22: Chef will take one session of type 11 and one session of type 22. Thus, in 33 hours, he earns a total of 1⋅1+1⋅2=31⋅1+1⋅2=3 rupees.Test case 33: Chef will take one session of type 11 and two sessions of type 22. Thus, in 55 hours, he earns a total of 1⋅2+2⋅6=141⋅2+2⋅6=14 rupees.

Chef and his girlfriend went on a date. Chef took 𝑋X dollars with him, and was quite sure that this would be enough to pay the bill. At the end, the waiter brought a bill of 𝑌Y dollars. Print "YES" if Chef has enough money to pay the bill, or "NO" if he has to borrow from his girlfriend and leave a bad impression on her.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of a single line of input, containing two space-separated integers 𝑋X and 𝑌Y.Output FormatFor each test case, output on a new line "YES" if Chef has enough money to pay the bill and "NO" otherwise.You may print each character of the string in either uppercase or lowercase (for example, the strings "yEs", "yes", "Yes" and "YES" will all be treated as identical).Constraints1≤𝑇≤1001≤T≤1001≤𝑋,𝑌≤1001≤X,Y≤100Sample 1:InputOutput41 11 22 150 100YESNOYESNOExplanation:Test case 11: Since the money Chef has is equal to the bill, he will be able to pay the bill.Test case 22: Since the money Chef has is less than the bill, he will have to borrow from his girlfriend and leave a bad impression on her.Test case 33: Since the money Chef has is greater than the bill, he will be able to pay the bill.Test case 44: Since the money Chef has is less than the bill, he will have to borrow from his girlfriend and leave a bad impression on her.

Chef is playing a mobile game. In the game, Chef's character Chefario can perform special attacks. However, one special attack costs 𝑋X mana points to Chefario.If Chefario currently has 𝑌Y mana points, determine the maximum number of special attacks he can perform.Input FormatThe 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 space-separated integers 𝑋X and 𝑌Y — the cost of one special attack and the number of mana points Chefario has initially.Output FormatFor each test case, output the maximum number of special attacks Chefario can perform.Constraints1≤𝑇≤1051≤T≤10 5 1≤𝑋≤1001≤X≤1001≤𝑌≤10001≤Y≤1000Sample 1:InputOutput310 306 4150 2360Explanation:Test case 11: Chefario can perform a maximum of 33 special attacks which will cost him 3030 mana points.Test case 22: Chefario can perform a maximum of 66 special attacks which will cost him 3636 mana points. Note that Chefario can not perform 77 special attacks as these will cost him 4242 mana points while he has only 4141 mana points.Test case 33: Chefario will not be able to perform any special attacks in this case.

Chef is eagerly waiting for a piece of information. His secret agent told him that this information would be revealed to him after 𝐾K weeks.𝑋X days have already passed and Chef is getting restless now. Find the number of remaining days Chef has to wait for, to get the information.It is guaranteed that the information has not been revealed to the Chef yet.Input FormatThe 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 space-separated integers 𝐾K and 𝑋X, as described in the problem statement.Output FormatFor each test case, output the number of remaining days that Chef will have to wait for.Constraints1≤𝑇≤5001≤T≤5001≤𝐾≤101≤K≤101≤𝑋<7⋅𝐾1≤X<7⋅KSample 1:InputOutput41 51 61 11 22165Explanation:Test case 11: The information will be revealed to the Chef after 11 week, which is equivalent to 77 days. Chef has already waited for 55 days, so he needs to wait for 22 more days in order to get the information.Test case 22: The information will be revealed to the Chef after 11 week, which is equivalent to 77 days. Chef has already waited for 66 days, so he needs to wait for 11 more day in order to get the information.Test case 33: The information will be revealed to the Chef after 11 week, which is equivalent to 77 days. Chef has already waited for 11 day, so he needs to wait for 66 more days in order to get the information.Test case 44: The information will be revealed to the Chef after 11 week, which is equivalent to 77 days. Chef has already waited for 22 days, so he needs to wait for 55 more days in order to get the information.