数塔

#include<stdio.h>
int fun1(int a,int b)
{
	return a>b?a:b;
}
int fun2(int num)
{
   int i,j,m,n;
   int a[10][10]={0},d[10][10]={0};
    for (i=0;i<num;i++)
    for (j=0;j<=i;j++)
		scanf("%d",&a[i][j]);
	for (j=0;j<num;j++)
		d[num-1][j]=a[num-1][j];
	for (i=num-2;i>=0;i--)
		for (j=0;j<=i;j++)
			d[i][j]+=a[i][j]+fun1(d[i+1][j],d[i+1][j+1]);
		printf("%d\n",d[0][0]);
		return 0;
}
int main()
{
   int num;
   scanf("%d",&num);
   while (num)
   {
   fun2(num);
    scanf("%d",&num);
   }
  return 0;
}