大数乘方取余(快幂）

#include<stdio.h>
int quickMod(long a, long b, long c)
{
	int ans = 1;
	while (b)
	{
		if (b % 2 == 1)
			ans = (ans * a) % c;
		b /= 2;
		a = (a * a) % c;
	}
	return ans;
}
int main()
{
	long num1,num2;
	int n;
	while (scanf("%d", &n) != EOF)
	{
		for (int t = 1; t <= n; t++)
		{
			scanf("%ld %ld", &num1,&num2);
			long k = quickMod(num1,num2, 998244353);
			printf("%ld\n", k);
		}
	}
	return 0;

}