HDU 2116 JAVA

Problem Description
As we all know, in the computer science, an integer A is in the range of 32-signed integer, which means the integer A is between -2^31 and (2^31)-1 (inclusive), and A is a 64-signed integer, which means A is between -2^63 and (2^63)-1(inclusive). Now we give the K-signed range, and two K-signed integers A and B, you should check whether the sum of A and B is beyond the range of K-signed integer or not.

Input
There will be many cases to calculate. In each case, there comes the integer K (2<=K<=64) first in a single line. Then following the line, there is another single line which has two K-signed integers A and B.

Output
For each case, you should estimate whether the sum is beyond the range. If exceeded, print “Yes”, otherwise “WaHaHa”.

Sample Input
32
100 100

Sample Output
WaHaHa

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        while (sc.hasNext()) {
            int k = sc.nextInt();
            BigInteger a = sc.nextBigInteger();
            BigInteger b = sc.nextBigInteger();
            BigInteger sum = b.add(a);
            BigInteger max = BigInteger.valueOf(2).pow(k - 1)
                    .subtract(BigInteger.ONE); // 2的K-1次方 减1
            BigInteger low = BigInteger.valueOf(2).pow(k - 1)
                    .multiply(BigInteger.valueOf(-1)); // 2的k-1次方乘以-1
            if (sum.compareTo(max) > 0 || sum.compareTo(low) < 0) {
                System.out.println("Yes");
            } else {
                System.out.println("WaHaHa");
            }
        }
    }

}