（HDU）1420-- Prepared for New Acmer

题目链接：https://vjudge.net/problem/HDU-1420

根据（a%c）*（b%c）=（a+b）%c来优化，防止数据溢出。数据用long long

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstdlib>

using namespace std;

int main()
{
    long long a,b,c;
    int t,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d %I64d %I64d",&a,&b,&c);
        long long ans=1;
        a%=c;
        for(i=1;i<=b;i++)
        {
            ans*=a;
            ans%=c;
        }
        printf("%I64d
",ans);
    }
    return 0;
}