# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
185381 | Ruxandra985 | Genetics (BOI18_genetics) | C++14 | 478 ms | 17016 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>
#define MOD 1000000007
using namespace std;
long long sum[4110][5];
char a[4110][4110];
int convert (char c){
if (c == 'A')
return 0;
if (c == 'C')
return 1;
if (c == 'G')
return 2;
return 3;
}
int check (int x , int n , int m, int k){
int i , j , dif;
for (i=1;i<=n;i++){
if (i == x)
continue;
dif = 0;
for (j=1;j<=m;j++){
if (a[x][j] != a[i][j])
dif++;
if (dif > k)
return 0;
}
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... |