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>
using namespace std;
#define ll long long
#define pb push_back
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2")
const int N = 4100 + 4;
int n, m, k;
char s[N][N];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> k;
for (int i = 0; i < n; ++i) {
cin >> s[i];
}
for (int i = 0; i < n; ++i) {
int cntOk = 0;
for (int j = 0; j < n; ++j) {
if (j == i) {
continue;
}
int cnt = 0;
for (int l = 0; l < m; ++l) {
cnt += (s[i][l] != s[j][l]);
}
cntOk += (cnt == k);
}
if (cntOk == n - 1) {
cout << i + 1;
return 0;
}
}
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |