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
题目要求:
输入n行数据,每行包括A,B,C。对于第i行数据,如果A+B>C则输出Case #i: true,否则输出Case #i: false
解题思路:
这里要注意 A, B,C的范围是 [−2^63,2^63],而long long所能存储的范围是[−2^63,2^63-1],所能表示的A+B最大的值是2*(2^63-1)=2^64-2
算法笔记中的解释:(有待验证)
注意:
除了这两点,还有一个要注意就是两个负数相加的时候,结果需要大于等于,否则最后一个测试点会报错。
完整代码:
#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,r;
int n,i;
cin>>n;
for(i=1;i<=n;i++){
string result="false";
cin>>a>>b>>c;
r=a+b;
if(a>0&&b>0&&r<0) result="true";
else if(a<0&&b<0&&r>=0) result="false";
else if(r>c) result="true";
cout<<"Case #"<<i<<": "<<result<<endl;
}
return 0;
}