# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
221379 | super_j6 | Genetics (BOI18_genetics) | C++14 | 233 ms | 82936 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 <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define endl '\n'
#define pi pair<int, int>
#define f first
#define s second
#define ull unsigned long long
const int maxn = 4101, w = 4, b = 33;
int n, m, k;
int a[maxn][maxn];
ull p[maxn];
ull ss[maxn][w];
ull f, g;
int main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
cin >> n >> m >> k;
p[0] = 1;
for(int i = 1; i <= n; i++){
string s;
cin >> s;
p[i] = b * p[i - 1];
f += p[i], g += k * p[i];
# | 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... |