ZJU-PAT 1065. A+B and C (64bit) (20)-白红宇

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

阅读量：6113 次

发布时间：2019-06-21

本文共 1216 字，大约阅读时间需要 4 分钟。

Given three integers A, B and C in [-2⁶³, 2⁶³], 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:

31 2 32 3 49223372036854775807 -9223372036854775808 0

Sample Output:

Case #1: falseCase #2: trueCase #3: false

分析：

1.考虑相加溢出的情况

(1) a > 0 && b>0 && a+b <0 , 因 a+b > c，故true

(2) a < 0 && b<0 && a+b >0 , 因 a+b < c，故false

2. PAT上不支持 __int64数据,採用long long型数据

#pragma warning (disable:4786)#include
     
      #include
      
       #include
       
        #include
        
         #include
         using namespace std;int main(){    int T;    cin>>T;    for(int i=1;i<=T;i++)    {        long long int  a,b,c;        cin>>a>>b>>c;        cout<<"Case #"<
          
           <<": "; bool flag; long long ans =a+b; if(a>0 && b>0 && ans<=0) flag=true; else if(a<0 && b <0 && ans >= 0) flag=false; else flag = (ans > c); if(flag) cout<<"true"<