# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
40120 | toonewbie | Palindromic Partitions (CEOI17_palindromic) | C++14 | 1340 ms | 13852 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 intt long long
#define all(v) (v).begin(),v.end()
const intt maxx = 1000006;
const intt MOD = 1000000009;
using namespace std;
intt powmod (intt a, intt b, intt mod) {
intt res = 1;
a %= mod;
while (b) {
if (b & 1)
res *= a;
res %= mod;
a = (a * a) % mod;
b >>= 1;
}
return res;
}
intt h[maxx];
int main() {
ios_base :: sync_with_stdio(0);
cin.tie(0);
/*
string a = "bonobo";
intt t = 31;
for (intt i = 0; i < a.size(); 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... |