POJ 1995.Raising Modulo Numbers

关键部分：People are different. Some secretly read magazines full of interesting girls' pictures O v O

题目大意：把几个乘方数加和在一起，之后输出，不过好像没有明确说出A B的取值范围？

 

题目链接

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

#define ll long long


ll fastpow(ll b,ll n,ll m)//b^n(mod m)
{
    ll a = 1;
    while(n>0)
    {
        if(n%2==0)
        {
            a = a;
            b = ((b%m)*(b%m))%m;
            n/=2;
        }
        else//奇数
        {
            a = ((a%m)*(b%m))%m;
            b = ((b%m)*(b%m))%m;
            n = (n-1)/2;
        }
    }
    return a;
}



using namespace std;
int main(void)
{
//    ll temp = fastpow(5, 3, 100);
//    cout<<temp<<endl;
    int z;
    scanf("%d",&z);
    for(int i=0;i<z;i++)
    {
        int m;
        scanf("%d",&m);
        int h;
        scanf("%d",&h);
        ll temp = 0;
        for(int j=0;j<h;j++)
        {
            ll b;
            ll n;
            scanf("%lld%lld",&b,&n);
            temp =((temp%m)+(fastpow(b, n, m)%m))%m;
        }
        printf("%lld\n",temp);
    }
}