牛客网A+B和C PAT

import java.util.HashSet;
import java.util.Scanner;

import javax.swing.table.TableStringConverter;

public class Main {
public static void main(String[] args) {
Scanner scanner=new Scanner(System.in);
long a,b,c;
int t;
t=scanner.nextInt();
long h[][]=new long[t][3];
Main main1=new Main();
boolean flag;
for (int i = 0; i < t; i++) {
h[i][0]=scanner.nextLong();
h[i][1]=scanner.nextLong();
h[i][2]=scanner.nextLong();
flag=main1.test(h[i][0], h[i][1], h[i][2]);
if (flag) {
System.out.println(“Case #”+(i+1)+": true");
}else{
System.out.println(“Case #”+(i+1)+": false");
}
}

}
public boolean test(long a,long b,long c) {
	if ((a+b)>c) {
		return true;
	}
	return false;
}

}