POJ 1995.Raising Modulo Numbers

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

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

 

题目链接

#include 
#include 
#include 
#include 
#include 

#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<

 

你可能感兴趣的:(POJ,1995,快速幂取模,数论,数学思想)