View Code of Problem 65

#include <stdio.h>
int main()
{
	int m, n, l, i, j, a[500][500];
	l = 0;
	scanf("%d", &m);
	while (l < m)
	{
		scanf("%d", &n);
		for (i = 0; i < n; i++)
		{
			for (j = 0; j < (n - i + n - i - 1) / 2; j++)
				printf(" ");
			for (j = 0; j <= i; j++)
				scanf("%d", &a[i][j]);
		}
		for (i = n - 2; i >= 0; i--)
		{
			for (j = 0; j <= i; j++)
			{
				if (a[i + 1][j] >= a[i + 1][j + 1])
					a[i][j] += a[i + 1][j];
				else
					a[i][j] += a[i + 1][j + 1];
			}
		}
		printf("%d\n", a[0][0]);
		l++;
	}
	return 0;
}