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<string>
#include<algorithm>
#include<vector>
#include<queue>
using namespace std;
int main(){
	int n;
	cin >> n;
	long long int a, b, c;
	for (int i = 0; i < n; i++) {
		cin >> a >> b >> c;
		long long int tmp = a + b;
		if (a > 0 && b > 0 && tmp < 0) {
			printf("Case #%d: true\n", i + 1);
		}
		else if (a < 0 && b < 0 && tmp >= 0) printf("Case #%d: false\n", i + 1);
		else if (tmp > c)
			printf("Case #%d: true\n", i + 1);
		else printf("Case #%d: false\n", i + 1);
	}
	return 0;
}