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

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

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

核心知识点

1.long long int 范围[-2⁶³,2⁶³),int范围[-2³¹,2³¹)
2.如果两个正数之和等于负数或两个负数之和等于正数，就是溢出
3.溢出边界计算：
正溢出：a+b最大为2⁶⁴-2,右边界为（2⁶⁴-2)%(2⁶⁴)=-2,即边界为[-2⁶³,-2]
负溢出：[0,2⁶³)

完整代码

#include<cstdio>
#include<cstring>
#include<algorithm>

using namespace std;



int main()
{
	int n;
	long long int a, b, c;
	scanf_s("%d", &n);
	for (int i = 0; i < n; i++)
	{
		scanf_s("%lld%lld%lld", &a, &b, &c);
		//= or !=边界问题
		if (a > 0 && b > 0&&a + b < 0)
		{
			printf_s("Case #%d: true\n",i + 1);
		}
		else if (a < 0 && b < 0 && a + b >= 0)
		{
			printf_s("Case #%d: false\n", i + 1);
		}
		else
		{
			if (a + b > c)
			{
				printf_s("Case #%d: true\n", i + 1);
			}
			else
			{
				printf_s("Case #%d: false\n", i + 1);
			}
		}
	}
	return 0;
}