Election HopesThe elections in Chefland have concluded, and the results are in!Chef received 𝑋X votes, and his rival Chefu received 𝑌Y.Chef thinks he dominated the election if and only if he received at least double the number of votes Chefu received.Did Chef dominate the election?Input FormatThe only line of input contains two space-separated integers 𝑋X and 𝑌Y — the number of votes received by Chef and Chefu, respectively.Output FormatPrint a single line containing the answer: either "Yes" or "No" (without quotes), depending on whether Chef dominated the election or not.

Remaining NeighborhoodsAs elections approach the country of Chefland, Chef's campaign is in full swing.Chef's city has exactly 100100 neighborhoods.Chef has already visited 𝑁N of them to canvass for votes, and he won't stop till he's visited every last one of them!How many more neighborhoods does Chef need to visit?Input FormatThe only line of input will contain a single integer 𝑁N, the number of neighborhoods Chef has already visited.Output FormatPrint a single integer: the number of neighborhoods Chef still needs to visit.Constraints0≤𝑁≤1000≤N≤100Sample 1:InputOutput7822Explanation:Chef has visited 7878 out of the 100100 neighborhoods. That leaves 2222 more for him to visit.Sample 2:InputOutput1000Explanation:Chef has visited every neighborhood already.

Athletes of Chefland have won 𝐺G gold medals, 𝑆S silver medals, and 𝐵B bronze medals in the Paris Olympics.Chef will be happy only if the Chefland team wins 55 medals of each type. Find the total number of additional medals the team needs to win to make Chef happy.Input FormatThe first and only line of input will contain three space-separated integers 𝐺,𝑆,G,S, and 𝐵B — the number of gold, silver, and bronze medals, respectively.Output FormatFor each test case, output on a new line, the total number of additional medals the team needs to win to make Chef happy.Constraints1≤𝐺,𝑆,𝐵≤51≤G,S,B≤5Sample 1:InputOutput5 1 45Explanation:The team already has 55 gold medals. They need 44 silver medals and 11 bronze medal. Thus, a total of 55 medals are needed to make Chef happy.Sample 2:InputOutput2 1 111Explanation:The team needs 33 gold, 44 silver, and 44 bronze medals. Thus, they need a total of 1111 medals to make Chef happy.

If you wanna party, if you, if you wanna partyThen put your hands upChef wants to host a party with a total of 𝑁N people.However, the party hall has a capacity of 𝑋X people. Find whether Chef can host the party.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of two space-separated integers 𝑁N and 𝑋X — the total number of people and the capacity of the party hall.Output FormatFor each test case, output on a new line, YES, if Chef can host the party and NO otherwise.Each character of the output may be printed in either uppercase or lowercase. That is, the strings NO, no, nO, and No will be treated as equivalent.Constraints1≤𝑇≤1001≤T≤1001≤𝑁,𝑋≤101≤N,X≤10Sample 1:InputOutput42 54 36 610 9YESNOYESNOExplanation:Test case 11: Chef wants to host a party with 22 people. Since the capacity of the hall is 55, he can host the party.Test case 22: Chef wants to host a party with 44 people. Since the capacity of the hall is 33, he can not host the party.Test case 33: Chef wants to host a party with 66 people. Since the capacity of the hall is 66, he can host the party.Test case 44: Chef wants to host a party with 1010 people. Since the capacity of the hall is 99, he can not host the party.

In ChefLand, human brain speed is measured in bits per second (bps). Chef has a threshold limit of 𝑋X bits per second above which his calculations are prone to errors. If Chef is currently working at 𝑌Y bits per second, is he prone to errors?If Chef is prone to errors print YES, otherwise print NO.Input FormatThe only line of input contains two space separated integers 𝑋X and 𝑌Y — the threshold limit and the rate at which Chef is currently working at.Output FormatIf Chef is prone to errors print YES, otherwise print NO.You may print each character of the string in uppercase or lowercase (for example, the strings yes, Yes, yEs, and YES will all be treated as identical).Constraints1≤𝑋,𝑌≤1001≤X,Y≤100Sample 1:InputOutput7 9YESExplanation:Chef's current brain speed of 99 bps is greater than the threshold of 77 bps, hence Chef is prone to errors.Sample 2:InputOutput6 6NOExplanation:Chef's current brain speed of 66 bps is not greater than the threshold of 66 bps, hence Chef is not prone to errors.Sample 3:InputOutput31 53YESExplanation:Chef's current brain speed of 5353 bps is greater than the threshold of 3131 bps, hence Chef is prone to errors.Sample 4:InputOutput53 8NOExplanation:Chef's current brain speed of 88 bps is not greater than the threshold of 5353 bps, hence Chef is not prone to errors.

Chef and some of his friends are planning to participate in a puzzle hunt event.The rules of the puzzle hunt state:"This hunt is intended for teams of 66 to 88 people."Chef's team has 𝑁N people in total. Are they eligible to participate?Input FormatThe first and only line of input will contain a single integer 𝑁N: the number of people present in Chef's team.Output FormatPrint the answer: Yes if Chef's team is eligible to participate, and No otherwise.Each letter in the output may be printed in either uppercase or lowercase, i.e, the outputs NO, No, nO, no will all be treated as equivalent.Constraints1≤𝑁≤101≤N≤10Sample 1:InputOutput4NoExplanation:The puzzle hunt requires between 66 and 88 people in a team.44 isn't between 66 and 88, so Chef's team cannot participate.Sample 2:InputOutput7YesExplanation:Chef's team has 77 people, and 77 lies between 66 and 88.So, Chef's team can participate in the event.Sample 3:InputOutput8YesExplanation:Chef's team has 88 people, and 88 lies between 66 and 88.So, Chef's team can participate in the event.