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

1. Topic

2. Ideas

1. If n + n <= 0 is true
2. If the negative negative +> = 0 and false
3. Other normal computing

3. Notes

1. Use long long
2. Note overflow handling

4. Code

#include<cstdio>
#include<vector>
#include<string>

using namespace std;

#define MAXN 100001
#define INF 0x3fffffff

int t;
long long a, b, c;

long long A[11];
long long B[11];
long long C[11];

int main(){
    scanf("%d", &t);
    for(int i=1;i<=t;i++){
        scanf("%lld %lld %lld", &A[i], &B[i], &C[i]);
    }
    for(int i=1;i<=t;i++){
        if(A[i] > 0 && B[i] > 0 && A[i] + B[i] <= 0){
            printf("Case #%d: true\n", i);
        }else if(A[i] < 0 && B[i] < 0 && A[i] + B[i] >= 0){
            printf("Case #%d: false\n", i);
        }else{
            if(A[i] + B[i] > C[i]){
                printf("Case #%d: true\n", i);
            }else{
                printf("Case #%d: false\n", i);
            }
        }
    }
}