| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 3367 | 孙灏洋 | 对角线之和 | C++ | Wrong Answer | 0 | 0 MS | 256 KB | 343 | 2019-12-15 20:26:37 |
#include<iostream> using namespace std; int main(){ int a[101][101]; int n,sum; cin>>n; int i; for(i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cin>>a[i][j]; if(i+j-1==n){ sum+=a[i][j]; } if(i==j){ sum+=a[i][j]; } } } if(n%2!=0){ int k; k=n/2+1; sum-=a[k][k]; } cout<<sum; }