| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 3325 | 陶俊宸 | 对角线之和 | C++ | Accepted | 100 | 0 MS | 252 KB | 329 | 2019-12-15 19:22:23 |
#include<iostream> using namespace std; int main(){ short a,c=0,i,j; cin>>a; short b[a][a]; for(i=0;i<a;i++){ for(j=0;j<a;j++) { cin>>b[i][j]; } } for(i=0;i<a;i++){ for(j=0;j<a;j++){ if(i==j||i+j==a-1) { if(i==j&&i+j==a-1) continue; c+=b[i][j]; } } } cout<<c; return 0; }