快速幂取模的运算

//快速幂取模，
#include <iostream>

using namespace std;
//1.
//a^n%b
int modExp(int a, int n, int b)
{
    int t,y;
    t=1;y=a;
    while (n)
    {
        if (n&1) t=t*y%b;//若n为偶数;
        y=y*y%b;
        n>>=1;
    }
    return t;
}
//2.利用a^n%c = (((a%c)*a)%c......)
int modexp_simple(int a,int n,int b) 
{ 
    int ret = 1; 
    while (n--) 
    { 
        ret = a * ret % b; 
    } 
    return ret; 
}
int main()
{
    int a,n,b;
    while (cin>>a>>n>>b)
    {
        cout<<modExp(a,n,b)<<endl;
        cout<<modexp_simple(a,n,b)<<endl;
    }

    return 0;
}