NCPC2016-E- Exponial

题目描述

Illustration of exponial(3) (not to scale), Picture by C.M. de Talleyrand-Périgord via Wikimedia Commons Everybody loves big numbers (if you do not, you might want to stop reading at this point). There are many ways of constructing really big numbers known to humankind, for instance:

In this problem we look at their lesser-known love-child the exponial , which is an operation defined for all positive integers n as

For example, exponial(1) = 1 and  which is already pretty big. Note that exponentiation is right-associative:  .
Since the exponials are really big, they can be a bit unwieldy to work with. Therefore we would like you to write a program which computes exponial(n) mod m (the remainder of exponial(n) when dividing by m).

输入

The input consists of two integers n (1 ≤ n ≤ 109 ) and m (1 ≤ m ≤ 109 ).

输出

Output a single integer, the value of exponial(n) mod m.

样例输入

2 42

样例输出

2

a^b %c= a^(b%phi(c)+phi(c)) %c (b>=phi(c)）
如果 phi(c)>b 直接 a^b%c

对这个题来说，当n>4可以直接用这个算了

#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll fi(ll n)
{
    ll ans=n;
    for (int i=;i*i<=n;i++)
    {
        if (n%i==)
        {
            ans-=ans/i;
            while (n%i==) n/=i;
        }
    }
    if (n>) ans-=ans/n;
    return ans;
}

ll qpow(ll a, ll n, ll m) {
    a%=m;
    ll ret = ;
    while(n)
    {
        if (n&) ret=ret*a%m;
        a=a*a%m;
        n>>=;
    }
    return ret;
}
ll f(ll n, ll m)
{
    if (m==) return ;
    if (n==) return ;
    if (n==) return %m;
    if (n==) return %m;
    if (n==) return %m;
    return qpow(n, f(n-, fi(m)) % fi(m) + fi(m), m);
}
int main()
{
    ll n, m;
    while(cin >> n >> m)
    {
        cout << f(n, m) << endl;
    }
    return ;
}