1065 A+B and C (64bit)

Given three integers A, B and C in [−2^​63
​​ ,2⁶³], 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

思路

判断是否溢出：若A和B符号相同，与sum符号不同，则溢出。

AC代码

#include <cstdio>
#include <iostream>
using namespace std;
typedef long long ll;

int main(){ 
	int n;
	ll a, b, c;
	cin>>n;
	for(int i = 1; i <= n; i++){
		cin>>a>>b>>c;
		ll sum = a + b;
		cout<<"Case #"<<i<<": ";
		if(a > 0 && b > 0 && sum < 0) //上溢 
			cout<<"true"<<endl;
		else if(a < 0 && b < 0 && sum >= 0) //下溢
			cout<<"false"<<endl;
		else if(sum > c)
			cout<<"true"<<endl;
		else cout<<"false"<<endl;
	}
	return 0;
}