1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
| #include <cstdio>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 4e5 + 10, ini = 86583718;
const LL mod = 998244353;
LL A[N];
int n, k, rev[N];
LL binpow(LL b, int k)
{
LL res = 1;
while (k)
{
if (k & 1)
res = res * b % mod;
b = b * b % mod;
k >>= 1;
}
return res;
}
void PolyRev(int bit)
{
for (int i = 1; i < (1 << bit); i++)
rev[i] = (rev[i >> 1] >> 1) | ((i & 1) << (bit - 1));
}
void NTT(LL *x, int bit, int op)
{
PolyRev(bit);
int tot = 1 << bit;
for (int i = 0; i < tot; i++)
if (rev[i] < i)
swap(x[i], x[rev[i]]);
for (int mid = 1; mid < tot; mid <<= 1)
{
LL w1 = binpow(3, (mod - 1) / (mid << 1));
if (op == -1)
w1 = binpow(w1, mod - 2);
for (int i = 0; i < tot; i += (mid << 1))
{
LL cur = 1;
for (int j = 0; j < mid; j++, cur = cur * w1 % mod)
{
LL p = x[i + j], q = cur * x[i + j + mid] % mod;
x[i + j] = (p + q) % mod, x[i + j + mid] = (p - q + mod) % mod;
}
}
}
if (op == -1)
{
LL intot = binpow(tot, mod - 2);
for (int i = 0; i < tot; i++)
x[i] = x[i] * intot % mod;
}
}
void PolyInv(LL *x, LL *g, int len)
{
if (len == 1)
{
g[0] = binpow(x[0], mod - 2);
return;
}
int bit = 0;
while ((1 << bit) < (len << 1))
bit++;
int tot = 1 << bit;
PolyInv(x, g, len + 1 >> 1);
static LL c[N];
for (int i = (len + 1 >> 1); i < tot; i++)
g[i] = 0;
for (int i = 0; i < tot; i++)
c[i] = (i < len ? x[i] : 0);
NTT(g, bit, 1);
NTT(c, bit, 1);
for (int i = 0; i < tot; i++)
g[i] = (2 - g[i] * c[i] % mod + mod) % mod * g[i] % mod;
NTT(g, bit, -1);
for (int i = len; i < tot; i++)
g[i] = 0;
}
void PolyDerivate(LL *x, LL *g, int len)
{
for (int i = 1; i < len; i++)
g[i - 1] = x[i] * i % mod;
g[len - 1] = 0;
}
void PolyIntegrate(LL *x, LL *g, int len)
{
for (int i = 1; i < len; i++)
g[i] = x[i - 1] * binpow(i, mod - 2) % mod;
g[0] = 0;
}
void PolyLn(LL *x, LL *g, int len)
{
static LL c[N], d[N];
PolyDerivate(x, c, len);
PolyInv(x, d, len);
int bit = 0;
while ((1 << bit) < (len << 1))
bit++;
int tot = 1 << bit;
for (int i = len; i < tot; i++)
c[i] = d[i] = 0;
NTT(c, bit, 1);
NTT(d, bit, 1);
for (int i = 0; i < tot; i++)
c[i] = c[i] * d[i] % mod;
NTT(c, bit, -1);
for (int i = len; i < tot; i++)
c[i] = 0;
PolyIntegrate(c, g, len);
for (int i = len; i < tot; i++)
g[i] = 0;
}
void PolyExp(LL *x, LL *g, int len)
{
if (len == 1)
{
g[0] = 1;
return;
}
int bit = 0;
while ((1 << bit) < (len << 1))
bit++;
int tot = 1 << bit;
PolyExp(x, g, len + 1 >> 1);
static LL c[N];
for (int i = 0; i < tot; i++)
c[i] = 0;
PolyLn(g, c, len);
for (int i = 0; i < len; i++)
c[i] = (x[i] - c[i] + mod) % mod;
for (int i = len; i < tot; i++)
c[i] = 0;
c[0]++;
NTT(g, bit, 1);
NTT(c, bit, 1);
for (int i = 0; i < tot; i++)
g[i] = g[i] * c[i] % mod;
NTT(g, bit, -1);
for (int i = len; i < tot; i++)
g[i] = 0;
}
void PolyBinpow(LL *x, LL *g, int k, int len)
{
static LL c[N];
PolyLn(x, c, len);
for (int i = 0; i < n; i++)
c[i] = c[i] * k;
PolyExp(c, g, len);
}
void PolySqrt(LL *x, LL *g, int len)
{
PolyBinpow(x, g, mod + 1 >> 1, len);
}
void PolySin(LL *x, LL *g, int len)
{
static LL c[N], d[N], e[N];
int bit = 0;
while ((1 << bit) < (len << 1))
bit++;
int tot = 1 << bit;
for (int i = 0; i < tot; i++)
c[i] = i < len ? x[i] * ini % mod : 0;
PolyExp(c, d, len);
for (int i = 0; i < tot; i++)
c[i] = i < len ? mod - x[i] * ini % mod : 0;
PolyExp(c, e, len);
LL in2i = binpow(2 * ini % mod, mod - 2);
for (int i = 0; i < len; i++)
g[i] = (d[i] - e[i] + mod) % mod * in2i % mod;
}
void PolyCos(LL *x, LL *g, int len)
{
static LL c[N], d[N], e[N];
int bit = 0;
while ((1 << bit) < (len << 1))
bit++;
int tot = 1 << bit;
for (int i = 0; i < tot; i++)
c[i] = i < len ? x[i] * ini % mod : 0;
PolyExp(c, d, len);
for (int i = 0; i < len; i++)
c[i] = i < len ? mod - x[i] * ini % mod : 0;
PolyExp(c, e, len);
LL in2 = mod + 1 >> 1;
for (int i = 0; i < len; i++)
g[i] = (d[i] + e[i]) % mod * in2 % mod;
}
int main()
{
int op;
scanf("%d%d", &n, &op);
for (int i = 0; i < n; i++)
scanf("%lld", &A[i]);
static LL res[N];
op ? PolyCos(A, res, n) : PolySin(A, res, n);
for (int i = 0; i < n; i++)
printf("%lld ", res[i]);
return 0;
}
|