Chef wants to run at least 10001000 meters to reach his fitness goal.There's a rectangular park nearby, with a length of 𝑋X meters and a width of 𝑌Y meters.Can Chef complete his goal by running one loop around the park? (Loop meaning running the entire path around the edge of the park.)Input FormatThe only line of input will contain 22 space-separated integers 𝑋X and 𝑌Y, the length and the width of the rectangular park.Output FormatPrint "YES" if Chef will be able to complete his fitness goal, otherwise print "NO" (without quotes).You may print each character of the output in either uppercase or lowercase (for example, the strings YES, yEs, yes, and yeS will all be treated as identical).Constraints1≤𝑋,𝑌≤10001≤X,Y≤1000Sample 1:InputOutput400 100YESExplanation:The perimeter of the ground is (400+100+400+100)=1000𝑚(400+100+400+100)=1000m which is sufficient to complete Chef's morning run.Sample 2:InputOutput300 150NOExplanation:The perimeter of the ground is (300+150+300+150)=900𝑚(300+150+300+150)=900m which is not sufficient to complete Chef's morning run.

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.

Chef has finally decided to complete all of his pending assignments.There are 𝑋X assignments where each assignment takes 𝑌Y minutes to complete.Find whether Chef would be able to complete all the assignments in 𝑍Z days.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists three space-separated integers 𝑋,𝑌,X,Y, and 𝑍Z — the number of assignments, time taken in minutes to complete each assignment, and the number of days in which Chef wants to complete the assignments.Output FormatFor each test case, output on a new line, YES, if Chef would be able to complete all the assignments in 𝑍Z days. 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≤𝑇≤1051≤T≤10 5 1≤𝑋,𝑌≤1001≤X,Y≤1001≤𝑍≤101≤Z≤10Sample 1:InputOutput35 5 550 80 220 72 1YESNOYESExplanation:Test case 11: Chef needs a total of 5⋅5=255⋅5=25 minutes to complete all the assignments. Thus, he would be able to complete the assignments in 55 days.Test case 22: Chef needs a total of 50⋅80=400050⋅80=4000 minutes to complete all the assignments. However, in 22 days, he only has 2⋅24⋅60=28802⋅24⋅60=2880 minutes.Thus, he would not be able to complete the assignments in 22 days.Test case 33: Chef needs a total of 20⋅72=144020⋅72=1440 minutes to complete all the assignments. In 11 days, he has 24⋅60=144024⋅60=1440 minutes.Thus, he would be able to complete the assignments in 11 day.

Chef and Brain SpeedIn 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.

Chef wants to cut pizza into 𝑋X slices where 𝑋X is always even.Your task is to determine the number of pieces that will be smaller than the rest.Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.Each test case consists of single line of input, containing one even integer 𝑋X — the number of slices Chef wants to cut.Output FormatFor each test case, output on a new line, the number of slices which are smaller than the others.

Chef's son wants to go on a roller coaster ride. The height of Chef's son is 𝑋X inches while the minimum height required to go on the ride is 𝐻H inches. Determine whether he can go on the ride or not.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 integers 𝑋X and 𝐻H - the height of Chef's son and the minimum height required for the ride respectively.Output FormatFor each test case, output in a single line, YES if Chef's son can go on the ride. Otherwise, output NO.You may print each character of YES and NO in uppercase or lowercase (for example, yes, yEs, Yes will be considered identical)Constraints1≤𝑇≤10001≤T≤10001≤𝑋,𝐻≤1001≤X,H≤100Sample 1:InputOutput415 2050 4832 3238 39NOYESYESNOExplanation:Test case 1: Chef's son can not go on the ride as his height << the minimum required height.Test case 2: Chef's son can go on the ride as his height ≥≥ the minimum required height.Test case 3: Chef's son can go on the ride as his height ≥≥ the minimum required height.Test case 4: Chef's son can not go on the ride as his height << the minimum required height.