PATA 1065 A+B and C (64bit)

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

时间限制
100 ms
内存限制
65536 kB
代码长度限制
16000 B
判题程序
Standard
作者
HOU, Qiming

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

#include <cstdio>
int main(){
	long long a, b, c;//必须用long long 存储abc
	int T, num = 0;
	bool flag;
	scanf("%d", &T); 
	while (T--)
	{
		scanf("%lld%lld%lld", &a, &b, &c);
		long long t = a + b;
		if (a > 0 && b > 0 && t < 0)	flag = true; //正溢出
		else if (a < 0 && b < 0 && t >= 0)	flag = false;//负溢出
		else if (t > c)	flag = true;  //未溢出
		else flag = false;
		num++;
		if (flag) printf("Case #%d: true\n",num);
		else printf("Case #%d: false\n", num);

	}
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值