# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
593898 | AlesL0 | Genetics (BOI18_genetics) | C++17 | 67 ms | 980 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.
#pragma GCC optimize("03")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
int comp(string a, string b){
int r = 0;
for (int i = 0; i < a.size(); i++)if (a[i] != b[i])r++;
return r;
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, k; cin >> n >> m >> k;
if (n <= 100 && m <= 100){
string x[n];
for (int i = 0; i < n; i++)cin >> x[i];
for (int i = 0; i < n; i++){
bool flag10 = 1;
for (int j = 0; j < n; j++){
if (i == j)continue;
if (comp(x[i], x[j]) != k){
flag10 = 0;
break;
}
Compilation message (stderr)
# | 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... |