| Run ID | Author | Problem | Lang | Verdict | Score | Time | Memory | Code Length | Submit Time |
|---|---|---|---|---|---|---|---|---|---|
| 51813 | zengjilin | 最优子图 | C++ | Wrong Answer | 10 | 1626 MS | 1232 KB | 235 | 2022-07-13 15:00:48 |
#include <bits/stdc++.h> using namespace std; int n,k,a[500][500]; int main() { scanf("%d %d",&n,&k); for(int i=1; i<=n ; i++) for(int j=1; j<=n; j++) scanf("%d",&a[i][j]); printf("%d",(n-1)*(n-2)/2); return 0; }