# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982695 | Alebn | Palindromic Partitions (CEOI17_palindromic) | C++14 | 349 ms | 48080 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 int long long
using namespace std;
int n, M = 1e9+7, P = 31, N = 1e6 + 1;
string s;
vector<int> p, inv, haah;
int mod(int i) {
return (i + M) % M;
}
int fast(int i, int j) {
//cout << i << " " << j << "\n";
if(j == 0) return 1;
int a = fast(i, j / 2);
return mod(mod(a * a) * (j % 2 == 0 ? 1 : i));
}
signed main() {
int t;
cin >> t;
//
p = vector<int>(N), inv = vector<int>(N);
p[0] = 1;
for(int i = 1; i < N; i++) p[i] = mod(p[i - 1] * P);
inv[N - 1] = fast(p[N - 1], M - 2);
for(int i = N - 2; i > -1; i--) inv[i] = mod(inv[i + 1] * P);
//
while(t--) {
# | 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... |