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

最新推荐文章于 2020-02-23 22:44:55 发布

peanwang

最新推荐文章于 2020-02-23 22:44:55 发布

阅读量305

点赞数 1

分类专栏： PAT-A

本文链接：https://blog.csdn.net/weixin_41256413/article/details/83155052

版权

PAT-A 专栏收录该内容

81 篇文章 1 订阅

订阅专栏

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

解析

Python 大法好

T = int(input())
for i in range(T):
	A,B,C = map(int,input().split())
	if A+B>C:
		print("Case #%d: true"%(i+1))
	else:
		print("Case #%d: false"%(i+1))

这题考计算机是怎么存储整数。
在这里插入图片描述
这里把情况缕一缕：如果A>0,B>0，但是sum<0。那么A+B溢出了，A+B肯定大于C
如果A<0,B<0，但是sum>=0。那么A+B溢出了，A+B肯定小于C。
其他情况就正常处理就行，

Code:

#include <stdio.h>
int main()
{
	int N;
	scanf("%d", &N);
	long long  A, B, C;
	for (int i = 1; i <= N; i++) {
		scanf("%lld %lld %lld", &A, &B, &C);
		long long result = A + B;
		if (A > 0 && B > 0 && result < 0)		printf("Case #%d: true\n", i);
		else if (A < 0 && B < 0 && result >=0)	printf("Case #%d: false\n", i);
		else if (result > C)					printf("Case #%d: true\n", i);
		else									printf("Case #%d: false\n", i);
	}
}