View Code of Problem 65

#include<stdio.h>
int main()
{
	int t, r;
	while (scanf("%d",&t)!=EOF)
	{
		while (t--)
		{
			scanf("%d", &r);
			int a[1000][1000] = { 0 };
			for (int i = 0; i < r; i++)
			{
				for (int j = 0; j <= i; j++)
				{
					scanf("%d", &a[i][j]);
				}
			}
			int max = 0;
			for (int i = r-1; i >0 ; i--)
			{
				for (int j = 0; j < i; j++)
				{
					max = a[i][j] > a[i][j + 1] ? a[i][j] : a[i][j + 1];
					a[i - 1][j] += max;
				}
			}
			printf("%d", a[0][0]);
		}
	}
	return 0;
}