绝对清晰的矩阵求和

解题思路:

注意事项:

参考代码:

#include<stdio.h>

    int main(){

            int dp[3][3];

            int i,j,q=0,p=0;

            for(i=0;i<3;i++){

                    for(j=0;j<3;j++){

                            scanf("%d",&dp[i][j]);

                        }

            }

            for(i=0;i<3;i++){

                    for(j=0;j<3;j++){

                            if(i==j){

                                    q+=dp[i][j];

                            }

                            if(i+j==2){

                                    p+=dp[i][2-i];

                            }

                    }

            }

printf("%d %d",q,p);

return 0;

}