PAT A1065 2019.07.04 【模拟】

最新推荐文章于 2021-09-12 21:29:56 发布

Doria_Lee

最新推荐文章于 2021-09-12 21:29:56 发布

阅读量150

点赞数

分类专栏： PAT

本文链接：https://blog.csdn.net/lidaorui1001/article/details/94630085

版权

PAT 专栏收录该内容

98 篇文章 0 订阅

订阅专栏

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

Given three integers A, B and C in [−263,263], 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 double溢出情况的判断

#include<cstdio>
#include<iostream>

int main()
{
	long long int a;
	long long int b;
	long long int c;
	long long int temp;
	int T;
	scanf("%d", &T);
	for (int i = 1; i <= T; i++)
	{
		scanf("%lld%lld%lld", &a, &b, &c);
		temp = a + b;
		if (a > 0 && b > 0 && temp < 0)printf("Case #%d: true\n", i);
		else if (a < 0 && b < 0 && temp >= 0)printf("Case #%d: false\n", i);
		else if (temp > c)printf("Case #%d: true\n", i);
		else printf("Case #%d: false\n", i);
	}



}