[PAT-A] 1065 A+B and C (64bit)

Java

import java.math.BigInteger;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for (int i = 1; i <= t; i++) {
            BigInteger a = sc.nextBigInteger();
            BigInteger b = sc.nextBigInteger();
            BigInteger c = sc.nextBigInteger();
            if (a.add(b).compareTo(c) > 0) {
                System.out.println("Case #" + i + ": true");
            } else {
                System.out.println("Case #" + i + ": false");
            }
        }
    }
}

C++

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

typedef long long ll;

int n;

int main() {
    scanf("%d", &n);

    for (int i = 1; i <= n; ++i) {
        ll a, b, c;
        scanf("%lld%lld%lld", &a, &b, &c);

        printf("Case #%d: ", i);
        if (a - c + b > 0) printf("true\n");
        else printf("false\n");
    }

    return 0;
}