Submission #5382142

---

Source Code Expand

import numpy as np
from numpy.fft import fft, ifft

N = int(input())
N0 = 2**int(np.ceil(np.log2(2*N - 1))) # 2N以上の最小の(2の累乗数)
A = np.zeros(N0)
B = np.zeros(N0)
for i in range(N):
    A[i], B[i] = map(int, input().split())
    
ans = [0] # 1になる組合せは0個
ans += [int(round(a.real)) for a in ifft(fft(A) * fft(B))[:2*N-1]]
print(*ans, sep='\n')

Submission Info

Judge Result