以
∏
i
=
1
k
p
i
q
i
\prod _{i=1}^{k}p_i^{q_{i}}
∏i=1kpiqi的形式给出一个数
n
n
n,
p
i
≤
1
e
8
,
q
i
≤
1
e
8
p_i\leq1e8,q_{i}\leq1e8
pi≤1e8,qi≤1e8,并且不同的
p
i
p_{i}
pi不会超过
20
20
20个。求
∑
d
∣
n
ϕ
(
d
)
n
d
\sum_{d|n}\phi(d)\frac{n}{d}
∑d∣nϕ(d)dn。
所求的式子是一个与
n
n
n有关的狄利克雷卷积,而
ϕ
\phi
ϕ和
i
d
id
id都是积性函数,所求的是式子也是积性函数。对于积性函数,可以单独考虑每个质因数的答案,最后乘在一起。
也就是说对于第
i
i
i个质因数
p
i
q
i
p_{i}^{q_{i}}
piqi,记为
x
i
x_{i}
xi
∑
d
∣
x
i
ϕ
(
d
)
x
i
d
\quad \sum\limits_{d|x_{i}}\phi(d)\frac{x_{i}}{d}
d∣xi∑ϕ(d)dxi
=
ϕ
(
1
)
∗
p
i
q
i
+
∑
j
=
1
q
i
ϕ
(
p
i
j
)
p
i
q
i
p
i
j
=\phi(1)*p_{i}^{q_{i}}+\sum\limits_{j=1}^{q_{i}}\phi(p_{i}^{j})\frac{p_{i}^{q_{i}}}{p_{i}^{j}}
=ϕ(1)∗piqi+j=1∑qiϕ(pij)pijpiqi
=
p
i
q
i
+
∑
j
=
1
q
i
(
p
i
j
−
p
i
j
−
1
)
p
i
q
i
p
i
j
=p_{i}^{q_{i}}+\sum\limits_{j=1}^{q_{i}}(p_{i}^{j}-p_{i}^{j-1})\frac{p_{i}^{q_{i}}}{p_{i}^{j}}
=piqi+j=1∑qi(pij−pij−1)pijpiqi
=
p
i
q
i
−
1
(
p
i
−
q
i
+
p
i
q
i
)
=p_{i}^{q_{i}-1}(p_{i}-q_{i}+p_{i}q_{i})
=piqi−1(pi−qi+piqi)
答案就是
∏
i
=
1
k
p
i
q
i
−
1
(
p
i
−
q
i
+
p
i
q
i
)
\prod\limits_{i=1}^{k}p_{i}^{q_{i}-1}(p_{i}-q_{i}+p_{i}q_{i})
i=1∏kpiqi−1(pi−qi+piqi)
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
const int mod=998244353;
const int N=21;
ll p[N],q[N];
void mul(ll &x,ll y) {
if(x*y>=mod) x=(x*y)%mod;
else x*=y;
}
ll fpow(ll x,ll y) {
ll ans=1;
while(y) {
if(y&1) ans=(ans*x)%mod;
x=(x*x)%mod;
y>>=1;
}
return ans;
}
int main() {
int T;
scanf("%d",&T);
while(T--) {
int n;
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%lld%lld",&p[i],&q[i]);
ll ans=1;
for(int i=1;i<=n;i++) {
mul(ans,fpow(p[i],q[i]-1));
mul(ans,((p[i]-q[i]+mod)%mod+p[i]*q[i]%mod)%mod);
}
printf("%lld\n",ans);
}
return 0;
}