The two versions are different problems. You may want to read both versions. You can make hacks only if both versions are solved.You are given two positive integers n𝑛, m𝑚.Calculate the number of ordered pairs (a,b)(𝑎,𝑏) satisfying the following conditions:1≤a≤n1≤𝑎≤𝑛, 1≤b≤m1≤𝑏≤𝑚;b⋅gcd(a,b)𝑏⋅gcd(𝑎,𝑏) is a multiple of a+b𝑎+𝑏.InputEach test contains multiple test cases. The first line contains the number of test cases t𝑡 (1≤t≤1041≤𝑡≤104). The description of the test cases follows.The first line of each test case contains two integers n𝑛, m𝑚 (1≤n,m≤2⋅1061≤𝑛,𝑚≤2⋅106).It is guaranteed that neither the sum of n𝑛 nor the sum of m𝑚 over all test cases exceeds 2⋅1062⋅106.OutputFor each test case, print a single integer: the number of valid pairs.ExampleinputCopy61 12 33 510 8100 12331000000 1145141outputCopy01164235933961

Alice and Bob were having an argument about which of them is taller than the other. Charlie got irritated by the argument, and decided to settle the matter once and for all.Charlie measured the heights of Alice and Bob, and got to know that Alice's height is 𝑋X centimeters and Bob's height is 𝑌Y centimeters. Help Charlie decide who is taller.It is guaranteed that 𝑋≠𝑌X=Y.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 integers 𝑋X and 𝑌Y, as described in the problem statement.Output FormatFor each test case, output on a new line AA if Alice is taller than Bob, else output BB. The output is case insensitive, i.e, both AA and aa will be accepted as correct answers when Alice is taller.Constraints1≤𝑇≤10001≤T≤1000100≤𝑋,𝑌≤200100≤X,Y≤200𝑋≠𝑌X=YSample 1:InputOutput2150 160160 150BAExplanation:Test case 11: In this case, 150<160150<160 so Bob is taller than Alice.Test case 22: In this case, 160>150160>150 so Alice is taller than Bob.

Your task is very simple: given two integers 𝐴A and 𝐵B, write a program to add these two numbers and output the sum.Input FormatThe first line contains an integer 𝑇T, the total number of test cases.Then follow 𝑇T lines, each line contains two integers, 𝐴A and 𝐵B.Output FormatFor each test case, add 𝐴A and 𝐵B and display the sum in a new line.Constraints1≤𝑇≤10001≤T≤10000≤𝐴,𝐵≤100000≤A,B≤10000Sample 1:InputOutput31 2100 20010 40330050Explanation:Testcase 1: 1+2=31+2=3. Hence the first output is 33.Testcase 2: 100+200=300100+200=300. Hence the second output is 300300.

Note: Refer to the visible test cases for more clarity.Constraint:0≤𝑎≤1020≤𝑏≤102Input Format: The input consists of two numbers each in a new line (integer).Output Format: The output represents the result of the division of the two numbers or any error that occurred while dividing.Sample Test CasesTest Case 1:Expected Output:Enter·the·value·of·'a':·1Enter·the·value·of·'b':·0Arithmetic·Exception:·/·by·zeroTest Case 2:Expected Output:Enter·the·value·of·'a':·sInput·Mismatch·Exception:·Please·enter·valid·integer·values.Test Case 3:Expected Output:Enter·the·value·of·'a':·50Enter·the·value·of·'b':·4Result·of·a/b:·12Submit1234567891011121314151617181920212223242526272829303132import·java.util.InputMismatchException;¬import·java.util.Scanner;¬¬public·class·ExceptionHandlingExample·{¬————public·static·void·main(String[]·args)·{¬········Scanner·scanner=new·Scanner(System.in);¬········¬········try·{¬········————System.out.println("Enter·the·value·of·'a':·");¬········————int·a·=·scanner.nextInt();¬········————¬········————System.out.println("Enter·the·value·of·'b':·");¬········————int·b·=·scanner.nextInt();¬········————¬········————int·result=·divide(a,·b);¬········————System.out.println("Result·of·a/b:·"+result);¬········}·catch·(·ArithmeticException·e·)·{¬········¬········————System.out.println("ArithmaticExeception:/·by·zero");¬········}·catch·(InputMismatchException·e··)·{¬········————¬········————System.out.println("Input·Mismatch·Exception:·Please·enter·valid·integer·value.");¬········}¬¬····}¬¬····public·static·int·divide(·int·a,·int·b·)·{¬····————return·a/b;¬····————¬····}¬}¬¶Execution Results 0 out of 3 shown cases successful0 out of 4 hidden cases successfulShow only failed cases Test Case - 1 (Execution Time: 180 ms) Expected Output User OutputEnter·the·value·of·'a':·1Enter·the·value·of·'a':·1Enter·the·value·of·'b':·0 ↥0Arithmetic·Exception:·/·by·zero Enter·the·value·of·'b':·Extra outputArithmaticExeception:/ by zero     : indicates the mismatch in the expected output. Test Case - 2 (Execution Time: 180 ms) Expected Output User OutputEnter·the·value·of·'a':·sEnter·the·value·of·'a':·sInput·Mismatch·Exception:·Please·enter·valid·integer·values. ↥     : indicates the mismatch in the expected output. Test Case - 3 (Execution Time: 197 ms) Expected Output User OutputEnter·the·value·of·'a':·50Enter·the·value·of·'a':·50Enter·the·value·of·'b':·4 ↥4Result·of·a/b:·12 Enter·the·value·of·'b':·Extra outputResult of a/b: 12

Pair-wise testing tests all possible combinations of a pair of ________ parameters. Type the correct answer into the text box.

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.