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 R=scanner.nextInt();
			int [][]a=new int[R][R];
			
			for (int j = 0; j < R; j++) {
				for (int  k= 0;  k<=j; k++) {
					a[j][k]=scanner.nextInt();
				}
			}
			max(a);
			System.out.println(a[0][0]);
		}
	}
	public  static void max(int a[][]) {
		int layer=a.length-2;
		for (int i = layer; i >=0; i--) {
			for (int j = 0; j <=i ; j++) {
				a[i][j]=a[i][j]+(Math.max(a[i+1][j], a[i+1][j+1]));
			}
		}
	}
	
}