1065 A+B and C (64bit) (20 分)

1065 A+B and C (64bit) (20 分)
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
Thanks to Jiwen Lin for amending the test data.

#include<iostream>
using namespace std;
int main() {
    int T, count = 1;
    cin >> T;
    while (T--) {
        long long A, B, C;
        scanf("%lld %lld %lld", &A, &B, &C);//不知道为什么用cin过不了测试点2
        long long sum = A + B;
        if (A > 0 && B > 0 && sum < 0) cout << "Case #" << count++ << ": true" << endl;//如果用A+B代替sum过不了测试点1
        else if (A < 0 && B < 0 && sum >= 0) cout << "Case #" << count++ << ": false" << endl;
        else if (sum > C) cout << "Case #" << count++ << ": true" << endl;
        else cout << "Case #" << count++ << ": false" << endl;
    }
    return 0;
}