HDU-6265 Master of Phi






#include<iostream>
#include<cmath>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef long long ll;
const ll mod=998244353;
ll quick(ll p,ll a)
{
    ll ans=1;
    while(a)
    {
        if(a&1)
            ans=ans*p%mod;
        a>>=1;
        p=p*p%mod;
    }
    return ans%mod;
}
int main()
{
    ll p[25],q[25];
    ll t;cin>>t;
    while(t--)
    {
        ll m;
        cin>>m;
        for(ll i=1;i<=m;i++)
        {
            scanf("%lld%lld",p+i,q+i);
        }
        ll ans=1;
        for(ll i=1;i<=m;i++)
        {
            ll mi=quick(p[i],q[i]-1);
            ans=ans*(p[i]*q[i]%mod+p[i]-q[i]+mod)%mod*mi%mod;
        }
        cout<<(ans+mod)%mod<<endl;
    }
}