1065 A+B and C (64bit)

1065 A+B and C (64bit)

nput 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>
#include<string>
#include<algorithm>
using namespace std;

int main()
{
  long long A = 0;
  long long B = 0;
  long long C = 0;
  long long sum = 0;
  int N;
  scanf_s("%d", &N);
  for (int i = 0; i < N; i++)
  {
    scanf_s("%lld", &A);
    scanf_s("%lld", &B);
    scanf_s("%lld", &C);
    sum = A + B;
    bool flag;

    if (A > 0 && B > 0 && sum < 0)
      flag = true;
    else if (A < 0 && B < 0 && sum >= 0)
      flag = false;
    else if (sum > C)
      flag = true;
    else
      flag = false;

    if (flag)
      printf("Case #%d: true", i + 1);
    else
      printf("Case #%d: false", i + 1);
    if (i < N - 1)
    {
      printf("\n");
    }
  }
}

由于该题目中A+B 的值有可能超出long long型数据的范围$[-2^{63},2^{63}-1]$，所以在进行大小判断时需要额外考虑溢出的情况