first.cpp

#include<bits/stdc++.h>
#define ll long long int
#define ss second
#define ff first
#define pb push_back
#define all(v) v.begin(),v.end()
#define unik(v)  v.erase(unique(v.begin(),v.end()),v.end())
using namespace std;
typedef pair<int, int> pii;
const ll mod = 998244353;
const int sz = 100 + 3, inf = 1e9 + 10;

int a[sz][sz], b[sz][sz], vis[sz];
int fr[sz], fr1[sz];
int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    int t, tc = 0;
    cin >> t;
    while (t--) {

        int n;
        cin >> n;
        memset(fr, 0, sizeof fr);
        memset(fr1, 0, sizeof fr1);

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= n; j++) {
                cin >> a[i][j];
                b[j][i] = a[i][j];
            }
        }
        int sum = 0;
        for (int i = 1; i <= n; i++)sum += a[i][i];

        int c1 = 0, c2 = 0;

        for (int i = 1; i <= n; i++) {
            memset(fr, 0, sizeof fr);
            bool f = 0;
            for (int j = 1; j <= n; j++) {
                fr[a[i][j]]++;
                if (fr[a[i][j]] > 1)f = 1;
            }
            if (f)c1++;
        }
        for (int i = 1; i <= n; i++) {
            bool f = 0;
            memset(fr1, 0, sizeof fr1);
            for (int j = 1; j <= n; j++) {
                fr1[b[i][j]]++;
                if (fr1[b[i][j]] > 1)f = 1;
            }
            if (f)c2++;
        }

        cout << "Case #" << ++tc << ": " << sum << ' ' << c1 << ' ' << c2 << '\n';

    }

    return 0;
}