View Code of Problem 65

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int T = scanner.nextInt();
        for (int i = 0; i < T; i++) {
            int n = scanner.nextInt();
            int[][] arr = new int[n][n];
            for (int j = 0; j < arr.length; j++) {
                for (int k = 0; k <= j; k++) {
                    arr[j][k] = scanner.nextInt();
                }
            }
            for (int j = arr.length-2; j >= 0; j--) {
                for (int k = 0; k <= j; k++) {
                    arr[j][k] = Math.max(arr[j][k] + arr[j+1][k], arr[j][k] + arr[j+1][k+1]);
                }
            }
            System.out.println(arr[0][0]);
        }
    }
}