D - K-based Numbers. Version 3（矩阵快速幂+快速乘法）

D - K-based Numbers. Version 3

Let’s consider K-based numbers, containing exactly N digits. We define a number to be valid if its K-based notation doesn’t contain two successive zeros. For example:

    1010230 is a valid 7-digit number;
    1000198 is not a valid number;
    0001235 is not a 7-digit number, it is a 4-digit number.

Given three numbers N, K and M, you are to calculate an amount of valid K based numbers, containing N digits modulo M.
You may assume that 2 ≤ N, K, M ≤ 10 18.

Input
The numbers N, K and M in decimal notation separated by the line break.
Output
The result in decimal notation.
Example
input output

2
10
100

	

90

#include <iostream>
typedef long long ll;
using namespace std;

struct two
{
    ll a[2][2];
};

ll n,k,mod;

ll addmi(ll a,ll b,ll mod)
{
    ll sum=0;
    a=a%mod;
    b=b%mod;
    while(b)
    {
        if(b&1)
        {
            sum=(sum+a)%mod;
        }
        a=(a+a)%mod;
        b=b/2;
    }
    return sum;
}

two updata(two a,two b,ll mod)
{
    two c= {0};
    int i,j,k;
    for(k=0; k<2; k++)
    {
        for(i=0; i<2; i++)
        {
            if(a.a[i][k]!=0)
            {
                for(j=0; j<2; j++)
                {
                    c.a[i][j]=(c.a[i][j]+addmi(a.a[i][k],b.a[k][j],mod))%mod;
                }
            }
        }
    }
    return c;
}

two mi(two a,ll x,ll mod)
{
    two b= {0};
    int i;
    for(i=0; i<2; i++)
    {
        b.a[i][i]=1;
    }
    while(x)
    {
        if(x&1)
        {
            b=updata(a,b,mod);
        }
        a=updata(a,a,mod);
        x=x/2;
    }
    return b;
}

int main()
{
    cin >> n >> k >> mod;
    two a= {0};
    two b= {0};
    a.a[0][0]=a.a[0][1]=k-1;
    a.a[1][0]=1;
    b.a[0][0]=k-1;
    two t;
    t=mi(a,n-1,mod);
    t=updata(t,b,mod);
    cout << (t.a[0][0]+t.a[1][0])%mod;
    return 0;
}