View Code of Problem 65

#include <bits/stdc++.h>
using namespace std;
int main(){
	int t;
	cin>>t;
	while(t--){
		int n;
		cin>>n;
		int a[n+1][n+1]={0};
		for(int i=1;i<=n;i++)
			for(int j=1;j<=i;j++)
				cin>>a[i][j];
		for(int i=n-1;i>=1;i--)
			for(int j=1;j<=i;j++){
				a[i][j]+=max(a[i+1][j],a[i+1][j+1]);
			}
		cout<<a[1][1]<<endl;
	} 
}