E - Geometric Progression(abc293)(矩阵乘法)

E - Geometric Progression (atcoder.jp)

算这个东西，结果是 {A^X ,1+A+A^2+...+A^(X-1)}{0,1};

#include <iostream>
#include <bits/stdc++.h>
#include <cstring>
#include <vector>
#include <queue>
#include <algorithm>
#define x first
#define y second
#define fu(i,a,b) for(int i=a;i<=b;i ++ )
#define fd(i,a,b) for(int i=a;i>=b;i -- )
#define endl '\n'
#define ms(x,y) memset(x,y,sizeof x)
#define ios ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
using namespace std;

typedef long long LL;
typedef vector<vector<LL>> VVL;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
typedef pair<double,int> PDI;
typedef pair<char,int> PCI;
typedef pair<string,int> PSI;
typedef pair<int,string> PIS;
typedef pair<LL,LL> PLL;
typedef __int128 i128;
typedef unsigned long long ULL;
const int N = 2e5+ 10,INF = 0x3f3f3f3f ;
const int mod = 1e9;
const double eps = 1e-8;


int A,X,M;

VVL mat_mul(VVL a ,VVL b,LL p)
{
    int n = a.size();
    VVL res(n,vector<LL>(n));
    
    fu(i,0,n-1)
    fu(j,0,n-1)
    fu(k,0,n-1)
    res[i][j]= (res[i][j] + a[i][k] * b[k][j]) % p;
    
    return res;
}

VVL mat_pow(VVL a,LL b,LL p)
{
    int n = a.size();
    VVL res (n,vector<LL>(n) ); // n * n     
    
    fu(i,0,n-1) res[i][i] = 1 ; // n * n的矩阵 ==1
        
    while(b)
    {
        if(b & 1 ) res = mat_mul(res,a,p);
        a = mat_mul(a,a,p);
        b >>=1;
    }
    return res;
}



inline void solve()
{
    LL a,x,m;cin >> a >> x >> m;
    VVL f={{a,1},{0,1}};
    VVL g=mat_pow(f,x,m);
    
    cout << g[0][1] <<endl;
    
    
}

signed main()
{
//  freopen("1.txt","w",stdout);
     ios

    int t=1;
//    cin>>t;
    int now = 1;
    while(t -- )
    {
//      cout<<"Case "; 
//      cout<<"Scenario #"; 
//      cout<< now ++ <<": ";
//      cout<< now ++ <<": \n";
        solve();
    }


    return 0;
}