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

#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <string>
#include <cctype>
#include <string.h>
#include <cstdio>
using namespace std;
int main()
{
    int n;
    cin>>n;
    long long a,b,c;
    for(int i=0;i<n;i++){
        cin>>a>>b>>c;
        long long sum=a+b;
        if(a>0&&b>0&&sum<0){
            printf("Case #%d: true\n",i+1);
        }else if(a<0&&b<0&&sum>=0){
            printf("Case #%d: false\n",i+1);
        }else if(sum>c){
            printf("Case #%d: true\n",i+1);
        }else{
            printf("Case #%d: false\n",i+1);
        }
    }
    return 0;
}