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
|
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <queue>
#include <set>
#include <vector>
#include <map>
#include <cassert>
#include <deque>
#include <cmath>
using namespace std;
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
char buf[1 << 21], *p1 = buf, *p2 = buf;
inline int gi(){
char tmp=getchar();int ans=0,flag=1;
while(!isdigit(tmp)){
if(tmp == '-') flag = -1;
tmp = getchar();
}
while(isdigit(tmp)){
ans = ans * 10 + tmp - '0';
tmp = getchar();
}
return ans * flag;
}
inline void in(int &x){x=gi();}
inline void in2(int &x,int &y){in(x),in(y);}
inline void in3(int &x,int &y,int &z){in(x),in(y),in(z);}
inline void in4(int &x,int &y,int &z,int &a){in3(x,y,z),in(a);}
inline void smax(int &x,int y){x=max(x,y);}
inline void smin(int &x,int y){x=min(x,y);}
#define MEM(arr,v) memset(arr,v,sizeof arr)
#define clr(f,n) memset(f,0,sizeof(int)*(n))
#define COPY(arr,goal) memcpy(arr,goal,sizeof goal)
#define For(i,a,b) for(int i=(int)(a);i<=(int)(b);++i)
const int N = 1002000, mod = 998244353;
#define ll long long
int Pow(int b,int p = mod - 2){
int ans = 1;
while(p){
if(p & 1)
ans = 1ll * ans * b % mod;
b = 1ll * b * b % mod;
p >>= 1;
}
return ans;
}
void Mod(int &x) {
while(x >= mod)
x -= mod;
}
void px(int *A,int *B,int len){
For(i,0,len)
A[i] = 1ll * A[i] * B[i] % mod;
}
int Rev[N];
void tpre(int &n){
int limit = 1,l = 0;
while(limit < n)
limit<<=1,++l;
n = limit;
For(i,0,limit-1)
Rev[i] = (Rev[i>>1]>>1) | ((i&1) << (l-1));
}
void init(int &n){
int limit = 1,cnt = 0;
while(limit < n) limit <<= 1,++cnt;
n = limit;
For(i,0,limit-1)
Rev[i] = (Rev[i>>1]>>1) | ((i&1) << (cnt - 1));
}
void Ntt(int *A,int len,int opt){
init(len);
For(i,0,len - 1)
if (i < Rev[i])
swap(A[i],A[Rev[i]]);
for (int i = 2 ; i <= len ; i <<= 1){
int m = i >> 1, wn = Pow(3,opt == 1 ? (mod-1)/i : mod - 1 - (mod-1)/i);
for(int j = 0 ; j < len ; j += i){
int w = 1;
for (int k = 0; k < m; ++k,w = 1ll * w * wn % mod){
int x = A[j + k] , y = 1ll * w * A[j + k + m] % mod;
Mod(A[j + k] = x + y);
Mod(A[j + k + m] = x - y + mod);
}
}
}
if(opt == -1){
int inv = Pow(len);
For(i,0,len - 1)
A[i] = 1ll * inv * A[i] % mod;
}
}
void times(int *A,int *B,int len){
static int sav[N<<1];
init(len);
clr(sav,len);
memcpy(sav,B,sizeof(int) * len);
Ntt(A,len,1);Ntt(sav,len,1);
px(A,sav,len);
Ntt(A,len,-1);
}
void GetInv(int *A,int *B,int len){
}
int A[N],B[N];
void Inv(int *a,int *b,int n){
b[0]=Pow(a[0]);
static int sav[N];
for(int k = 1; k <= n; k <<= 1){
int lim = k << 2;
init(lim);
For(i,0,(k<<1) - 1)
sav[i] = a[i];
Ntt(sav,k<<2,1);
Ntt(b,k<<2,1);
For(i,0,(k<<2)-1)
b[i] = 1ll * b[i] * (2 - 1ll * sav[i] * b[i] % mod + mod)% mod;
Ntt(b,k<<2,-1);
For(i,k<<1,(k<<2)-1) b[i] = 0;
}
}
int C[N],D[N];
void Sqrt(int *a,int *b,int len){
}
signed main()
{
#ifdef DMYTXDY
freopen("data.in","r",stdin);
#endif
int n = gi();
For(i,0,n-1) C[i] = gi();
Inv(C,D,n);
For(i,0,n-1)
printf("%d ",D[i]);
return 0;
return 0;
}
|