Master of Phi (欧拉函数 + 积性函数)

You are given an integer n. Please output the answer of∑d|n φ(d) × n/d modulo 998244353. n is represented in the form of factorization. φ(n) is Euler’s totient function, and it is defined more formally as the number of integers k in the interval 1 ≤ k ≤ n for which the greatest common divisor gcd(n,k) is equal to 1. For example, the totatives of n = 9 are the six numbers 1, 2, 4, 5, 7 and 8. They are all co-prime to 9, but the other three numbers in this interval, 3, 6, and 9 are not, because gcd(9,3) = gcd(9,6) = 3 and gcd(9,9) = 9. Therefore, φ(9) = 6. As another example, φ(1) = 1 since for n = 1 the only integer in the interval from 1 to n is 1 itself, and gcd(1,1) = 1. And there are several formulas for computing φ(n), for example, Euler’s product formula states like: φ(n) = n∏p|n(1− 1 p), where the product is all the distinct prime numbers (p in the formula) dividing n.
Input The first line contains an integer T (1 ≤ T ≤ 20) representing the number of test cases. For each test case, the first line contains an integer m(1 ≤ m ≤ 20) is the number of prime factors. The following m lines each contains two integers pi and qi (2 ≤ pi ≤ 108, 1 ≤ qi ≤ 108) describing that n contains the factor pi^qi, in other words, n =∏m i=1 piqi. It is guaranteed that all pi are prime numbers and different from each other. Output For each test case, print the the answer modulo 998244353 in one line.
Example
standard input standard output
2
2
2 1
3 1
2
2 2
3 2
15 168
Explanation Forfirsttestcase, n = 21∗31 = 6, andtheansweris (φ(1)∗n/1+φ(2)∗n/2+φ(3)∗n/3+φ(6)∗n/6) mod 998244353 = (6 + 3 + 4 + 2) mod 998244353 = 15.

以为会用到狄利克雷卷积，学了一下没学会嘤嘤嘤
看博客会了本题 https://www.cnblogs.com/letlifestop/p/10262791.html

#include <iostream>
#include <cstdio>
#include <cmath>
#define mod 998244353
using namespace std; 
typedef long long ll;
const int N = 26;

ll p[N], q[N]; 

ll qpow(ll a, ll b)
{
	ll res = 1;
	while(b){
		if(b&1)
			res = res*a%mod; 
		a = a*a%mod;
		b >>= 1;
	}
	return res;
}

int main()
{
	int t, n, i;
	scanf("%d", &t);
	while(t--){
		scanf("%d", &n);
		for(i = 1; i <= n; ++i)
			scanf("%lld%lld", &p[i], &q[i]);
		ll ans = 1;
		for(i = 1; i <= n; ++i){
			ans = ans*qpow(p[i], q[i]-1)%mod;
			ans = ans*(p[i]+(p[i]-1)*q[i]%mod)%mod;
		}
		printf("%lld\n", ans);
	}
	return 0;
}