Alice has scored 𝑋X marks in her test and Bob has scored 𝑌Y marks in the same test. Alice is happy if she scored at least twice the marks of Bob’s score. Determine whether she is happy or not.Input FormatThe first and only line of input contains two space-separated integers 𝑋,𝑌X,Y — the marks of Alice and Bob respectively.Output FormatFor each testcase, print Yes if Alice is happy and No if she is not, according to the problem statement.The judge is case insensitive so you may output the answer in any case. In particular YES, yes, yEsare all considered equivalent toYes`.Constraints1≤𝑋,𝑌≤1001≤X,Y≤100Sample 1:InputOutput2 1YesExplanation:Alice has scored 𝑋=2X=2 marks whereas Bob has scored 𝑌=1Y=1 mark. As Alice has scored twice as much as Bob (i.e. 𝑋≥2𝑌X≥2Y), the answer is Yes.

Alice has scored 𝑋X marks in her test and Bob has scored 𝑌Y marks in the same test.Alice is happy if she scored at least twice the marks of Bob’s score.Print "Yes" is she is happy.Other wise print nothing.Option 1:if (X >= 2 * Y) { printf("YES");}Option 2:if (X > 2*Y) { printf("YES");}Option 3:if (2*Y <= X) { printf("YES");}Option 4:if (2*Y >= X) { printf("YES");}

Bob received an assignment from his school: he has two numbers 𝐴A and 𝐵B, and he has to find the sum of these two numbers.Alice, being a good friend of Bob, told him that the answer to this question is 𝐶C.Bob doesn't completely trust Alice and asked you to tell him if the answer given by Alice is correct or not.If the answer is correct print "YES", otherwise print "NO" (without quotes).Input FormatThe first line of input will contain a single integer 𝑇T, denoting the number of test cases.The first and only line of each test case consists of three space-separated integers 𝐴,𝐵,A,B, and 𝐶C.Output FormatFor each test case, output on a new line the answer: YES if Alice gave the right answer, and NO otherwise.Each character of the output may be printed in either uppercase or lowercase, i.e, the outputs Yes, YES, yEs and yes will be treated as equivalent.Constraints1≤𝑇≤1001≤T≤1000≤𝐴,𝐵,𝐶≤1000≤A,B,C≤100Sample 1:InputOutput31 2 34 5 92 3 6YESYESNOExplanation:Test case 11: 1+2=31+2=3, so Alice's answer is correct.Test case 22: 4+5=94+5=9, so Alice's answer is correct.Test case 33: 2+3=52+3=5 which doesn't equal 66, so Alice's answer is incorrect.

Four friends want to attend a concert. Each ticket costs 𝑋X rupees.They have decided to go to the concert if and only if the total cost of the tickets does not exceed 10001000 rupees.Determine whether they will be going to the concert or not.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 integer 𝑋X, the cost of each ticket.Output FormatFor each test case, output YES if they will be going to the concert, NO otherwise.You can print each character in uppercase or lowercase. For example, the strings YES, yes, Yes, and yES, are all considered identical.Constraints1≤𝑇≤1001≤T≤1001≤𝑋≤10001≤X≤1000Sample 1:InputOutput41005002501000YESNOYESNOExplanation:Test case 11: The total cost of all tickets is 100⋅4=400100⋅4=400 which is ≤1000≤1000. Thus, they will go to the concert.Test case 22: The total cost of all tickets is 500⋅4=2000500⋅4=2000 which is >1000>1000. Thus, they will not go to the concert.Test case 33: The total cost of all tickets is 250⋅4=1000250⋅4=1000 which is ≤1000≤1000. Thus, they will go to the concert.Test case 44: The total cost of all tickets is 1000⋅4=40001000⋅4=4000 which is >1000>1000. Thus, they will not go to the concert.

Input format :The first line contains an integer 't' representing the number of test cases.Each test case consists of a single line with two space-separated integers 'x' and 'y', representing the scores of Sasha and Brenda, respectively, for a particular round.Output format :For each test case, the output prints the result of that round.If x is greater than y, the output prints "Sasha".If x is equal to y, the output prints "Tie".Otherwise, the output prints "Brenda"

Alice and Bob have four distinct integers a𝑎, b𝑏, c𝑐, d𝑑 not more than 1212. Alice ties a red string connecting a𝑎 and b𝑏, and Bob ties a blue string connecting c𝑐 and d𝑑. Do the strings intersect? (The strings are straight line segments.)InputThe first line contains a single integer t𝑡 (1≤t≤59401≤𝑡≤5940) — the number of test cases.The only line of each test case contains four distinct integers a𝑎, b𝑏, c𝑐, d𝑑 (1≤a,b,c,d≤121≤𝑎,𝑏,𝑐,𝑑≤12).OutputFor each test case, output "YES" (without quotes) if the strings intersect, and "NO" (without quotes) otherwise.You can output "YES" and "NO" in any case (for example, strings "yEs", "yes", and "Yes" will be recognized as a positive response).ExampleinputCopy152 9 10 63 8 9 11 2 3 45 3 4 121 8 2 103 12 11 89 10 12 112 1 10 23 12 6 91 9 8 46 7 9 127 12 9 610 12 11 13 9 6 121 4 3 5outputCopyYESNONOYESYESNONONONONONOYESYESYESYESNoteThe first test case is pictured in the statement.In the second test case, the strings do not intersect, as shown below.