| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1089017 | vjudge1 | Izbori (COCI17_izbori) | C++17 | 27 ms | 464 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
const signed MOD = 1e9 + 7;
const signed mod = 998244353;
using namespace std;
#define all(x) x.begin(), x.end()
#define ld long double
#define ll long long
#define pb push_back
#define mp make_pair
#define co cout <<
#define S second
#define F first
int n, m, k, ans, a[105][20];
void sol(vector<bool> v, int cn) {
    if (cn == m) return;
    v.pb(0);
    sol(v, cn + 1);
    v.pop_back();
    v.pb(1);
    sol(v, cn + 1);
    int f[20] = {};
    for (int i = 0; i < n; i++) {
        int j = 0;
        while (j < m && v[a[i][j]]) j++;
        if (j < m) f[a[i][j]]++;
    }
    int mx = 0, num;
    for (int i = 1; i <= m; i++) {
        if (f[i] > mx) {
            mx = f[i];
            num = i;
        }
    }
    if (num == k) ans = min(ans, cn);
    if (cn == 0) co num << '\n';
}
void solve() {
    cin >> n >> m >> k;
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < m; j++) {
            cin >> a[i][j];
        }
    }
    vector<bool> v;
    ans = m - 1;
    sol(v, 0);
    co ans;
}
signed main() {
    cin.tie(0)->sync_with_stdio(0);
    signed t = 1;
    // cin >> t;
    while (t--) solve();
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
