题目:
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, orCase #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
题目大意:给三个数字,都是2^64范围的数,比较a+b与c的大小
解题思想:用longlong存储,但a+b仍然可能溢出。
若a+b异号时不会溢出;
若a>0,b>0,a+b<0时,上溢;
若a<0,b<0,a+b>=0时,下溢,下溢可能为0;
代码:
#include<iostream>
#include<algorithm>
using namespace std;
int main(){
long long int a,b,c;
int n;
cin>>n;
int i=1;
while(n--){
cin>>a>>b>>c;
long long int sum=a+b;
if(a>0&&b>0&&sum<0){//上溢
printf("Case #%d: true\n",i);
}else if(a<0&&b<0&&sum>=0){//下溢,可能为0
printf("Case #%d: false\n",i);
}
else if(sum>c){
printf("Case #%d: true\n",i);
}else printf("Case #%d: false\n",i);
i++;
}return 0;
}