HDOJ1194 Beat the Spread!

Beat the Spread!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 7501    Accepted Submission(s): 3956

Problem Description

Superbowl Sunday is nearly here. In order to pass the time waiting for the half-time commercials and wardrobe malfunctions, the local hackers have organized a betting pool on the game. Members place their bets on the sum of the two final scores, or on the absolute difference between the two scores.

Given the winning numbers for each type of bet, can you deduce the final scores?

Input

The first line of input contains n, the number of test cases. n lines follow, each representing a test case. Each test case gives s and d, non-negative integers representing the sum and (absolute) difference between the two final scores.

Output

For each test case, output a line giving the two final scores, largest first. If there are no such scores, output a line containing "impossible". Recall that football scores are always non-negative integers.

Sample Input

2 40 20 20 40

Sample Output

30 10 impossible

import java.util.Scanner;

public class Main{
  private static Scanner scanner;
  public static void main(String[] args) {
    scanner = new Scanner(System.in);
    int cases = scanner.nextInt();
    while(cases-->0){
      int a = scanner.nextInt();
      int b = scanner.nextInt();
      if(a<b){
        System.out.println("impossible");
        continue;
      }
      if((a+b)%2!=0 || (a-b)%2!=0){
        System.out.println("impossible");
      }else {
        System.out.println((a+b)/2+" "+(a-b)/2);
      }
    }
  }
}
/*
      int a = scanner.nextInt();
      int b = scanner.nextInt();
      int m = (a+b)/2;
      int n = (a-b)/2;
      if(m<0 || n<0 || (a+b)%2!=0 || (a-b)%2!=0){
        System.out.println("impossible");
      }else {
        System.out.println(m+" "+n);
      }
*/
/*
输入2个数 a，b。
a是m,n的和，b是m,n的差。(m,n只能为正整数或者0)
如果m,n中出现了负数就输出impossible。
要注意的是m=(a+b)/2;n=(a-b)/2;
因为m,n是正整数，所以(a+b)%2==0且(a-b)%2==0;
*/