提出 #70682021

---

ソースコード 拡げる

N, U = map(int, input().split())

F = GF(998244353)
R.<y> = F[]
S.<x> = R[]

def Nth(n, u):
  fact = F(1)
  m = n
  while m > 1:
    fact *= m
    m -= 1
  Q = 1/F(2) * (1-y) * (-x^2*y - 6*x*y + 2*y^2 - 4*y + 2)
  P = fact * (-2*x*y + y^2 - 2*y + 1)
  while n > 0:
    nQ = Q(-x)
    P = S((P * nQ).list()[n%2::2])
    Q = S((Q * nQ).list()[::2])
    n //= 2
  return P(0).multiplication_trunc(Q(0).inverse_series_trunc(u+1), u+1)

ans = Nth(N, U).list()[1:]

for a in ans:
  print(a)

提出情報

ジャッジ結果