1065 A+B and C (64bit) (PAT Advanced) 坑点

Given three integers A, B and C in [−2^​63​​,2​^63​​], you are supposed to tell whether A+B>C.

Input Specification:

The first line of the input gives the positive number of test cases, T (≤10). Then T test cases follow, each consists of a single line containing three integers A, B and C, separated by single spaces.

Output Specification:

For each test case, output in one line Case #X: true if A+B>C, or Case #X: false otherwise, where X is the case number (starting from 1).

Sample Input:

3
1 2 3
2 3 4
9223372036854775807 -9223372036854775808 0

Sample Output:

Case #1: false
Case #2: true
Case #3: false

坑点：这个区间是双侧闭区间，long long的最大值是2^63-1，直接用long long存输入会导致溢出。最后写了高精度。

送一个测试

1
9223372036854775808 -9223372036854775808 -1

Case #1: true