PAT 1065 A+B and C (64bit) (20)

最新推荐文章于 2021-07-09 21:40:54 发布

ryo_218

最新推荐文章于 2021-07-09 21:40:54 发布

阅读量87

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/ryo_218/article/details/81570164

版权

PAT 专栏收录该内容

65 篇文章 1 订阅

订阅专栏

1065 A+B and C (64bit) (20)（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&gtC, 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>c，这需要一点小技巧了。LLONG_MAX和LLONG_MIN是longlong类型的最大范围和最小范围，在limits.h文件里面。上溢就是a+b>LLONG_MAX的情况，如果直接a+b算的话就溢出了，改成a>LLONG_MAX-b就可以了，下溢也是同理。

代码：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>  
#include <set>
using namespace std;

bool compare(long long a, long long b, long long c)
{
	if (a > 0 && b > 0 && a > LLONG_MAX - b)
		return true;
	if (a < 0 && b < 0 && a < LLONG_MIN - b)
		return false;
	return a + b > c;
}

int main()
{
	int n;
	long long a, b, c;
	cin>>n;
	for (int i = 1; i <= n; i++)
	{
		cin >> a >> b >> c;
		cout << "Case #" << i << ": ";
		if (compare(a,b,c))
			cout << "true" << endl;
		else
			cout << "false" << endl;
	}
	return 0;
}