# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1008596 | shikgom2 | 씽크스몰 (kriii3_TT) | Pypy 3 | 7693 ms | 429076 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.
import sys
input = sys.stdin.readline
from functools import reduce
import operator
MOD = 998244353
ROOT = 3
IROOT = pow(ROOT, MOD-2, MOD)
def NTT(v, inv):
S = len(v)
j = 0
for i in range(1, S):
bit = S // 2
while j >= bit:
j -= bit
bit //= 2
j += bit
if i < j:
v[i], v[j] = v[j], v[i]
k = 1
while k < S:
z = pow(ROOT if inv else IROOT, (MOD-1) // (2*k), MOD)
i = 0
while i < S:
w = 1
for j in range(k):
even = v[i + j]
odd = v[i + j + k] * w % MOD
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |