Bipin vs Balajiganapathi
Balajiganapathi and Bipin are brothers. They have saved their money to buy Dairy Milk for their respective girlfriend on this Valentine's day. Balaji managed to buy M chocolates and Bipin managed to buy N chocolates.
They have made a bet as if who will give more Dairy Milk to their girlfriend.If Bipin manages to give more chocolates then Bipin is considered as the winner, else Balaji is!
NOTE: If they both buy same number of chocolates, there is no winner.
The first line of the input contains an integer T denoting the number of test cases. The description of T test cases follows.Each line contains 2 integers- N and M-the number of chocolates they buy..
For each test case, output who wins the game and also by what margin does he win.(See the sample test cases) If there is a tie print "No Winner".
- 1 ≤ T ≤ 100
- 1 ≤ M ≤ 100000
- 1 ≤ N ≤ 100000
Input: 2 4 6 8 1 Output:
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, PYPY, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, SCM chicken, CLOJ, FS|
Fetching successful submissions