3.1 PAT A 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

注意此题为大整数运算，有可能会超过long long的范围64位。固需溢出判断。若为正溢出，则由机器数可知res为负，负溢出正好相反。

参考代码：

#include <cstdio>
int main()
{
	long long a,b,c;
	int t;
	scanf("%d",&t);
	for(int i=1;i<=t;++i)
	{
		scanf("%lld%lld%lld",&a,&b,&c);
		long long res=a+b;
		bool flag;
		if(a>0&&b>0&&res<0) //正溢出为true 
			flag =true;
		else if(a<0&&b<0&&res>=0) //负溢出为false 
			flag=false;
		else if(res>c)
			flag=true;
		else
			flag=false;
		if(flag)
			printf("Case #%d: true\n",i);
		else
			printf("Case #%d: false\n",i);
	}
	return 0;
 }