-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathVestigium.cpp
More file actions
44 lines (40 loc) · 1.02 KB
/
Copy pathVestigium.cpp
File metadata and controls
44 lines (40 loc) · 1.02 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin >> t;
for(int q=1;q<=t;q++) {
int n;
cin >> n;
int a[n][n];
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
cin >> a[i][j];
int k=0;
for(int i=0;i<n;i++)
k += a[i][i];
int c[n]={0}, r=0, col=0;
for(int i=0;i<n;i++) {
for(int k=0;k<n;k++) c[k]=0;
for(int j=0;j<n;j++) c[a[i][j]-1]++;
for(int k=0;k<n;k++) {
if(c[k]>1) {
r++;
break;
}
}
}
for(int i=0;i<n;i++) {
for(int k=0;k<n;k++) c[k]=0;
for(int j=0;j<n;j++) c[a[j][i]-1]++;
for(int k=0;k<n;k++) {
if(c[k]>1) {
col++;
break;
}
}
}
cout << "Case #" << q << ": " << k << " " << r << " " << col << endl;
}
}