Ŀ

գҪıйص䡣
һ repeat (0<repeat<10) repeat 㣺
 1  n(1n6), ٶ n ׷ a , þԽߡһкһԪ֮͡ԽΪӾϽ½ǵߡ
ʾΪ˵
룺
1        (repeat=1)
4        (n=4)
2 3 4 1
5 6 1 1
7 1 8 1
1 1 1 1
sum = 35   (2+3+4+5+6+7+8=35)



#include "stdio.h"
int main(void)
{
    int i, j, n, sum;
    int repeat, ri;
    int a[6][6];

    scanf("%d", &repeat);
    for(ri = 1; ri <= repeat; ri++){
        scanf("%d", &n);
        for(i = 0; i < n; i++)
            for(j = 0; j < n; j++)
                scanf("%d", &a[i][j]);
/*---------*/
        printf("sum = %d\n", sum);
    }
}
