374 big mod.cpp

来自「UVA solutions to few selected problems」· C++ 代码 · 共 37 行

#include<iostream>
#include<iomanip>
#include<cmath>
#define L unsigned long long int
L bigmod(L bb,L pp,L mm)
{
    L temp;
    if(pp==0)
    return 1;
    if(pp==1)
    return bb;
           if(pp%2!=0)
           {
                     temp=bigmod(bb,(pp-1)/2,mm);
                     temp=(temp*temp)%mm;
                     temp=(temp*bb)%mm;
                     return temp;
           }
           else
           {
                     temp=bigmod(bb,pp/2,mm);
                     temp=(temp*temp)%mm;
                     return temp;
           }
}
using namespace std;
int main()
{
    L b,p,m;
    while(cin>>b>>p>>m)
    {
                       L res=bigmod(b,p,m);
                       cout<<res<<endl;
    }
    system("pause");
}