洛谷p1306 斐波那契公约数

gcd(fib[i],fib[j]) = fib[gcd(i,j)];

太6了

#include<iostream>
#include<algorithm>
#include<cstring>
#include<string>
#include<cmath>
#include<cstdio>
#include<iomanip>

#define ll long long

using namespace std;

const int mod = 1e8;

ll a, b;

ll base[3][3];
ll res[2][2];
ll tmp[3][3];

void base_upd()
{
    for(int i = 1 ; i <= 2 ; i++){
        for(int j = 1 ; j <= 2 ; j++){
            for(int k = 1 ; k <= 2 ; k++){
                tmp[i][j] += base[i][k] * base[k][j] % mod;
                //tmp[i][j] %= mod;
            }
        }
    }
    
    for(int i = 1 ; i <= 2 ; i++){
        for(int j = 1 ; j <= 2 ; j++){
            base[i][j] = tmp[i][j] % mod;
        }
    }
    
    tmp[1][1] = tmp[1][2] = tmp[2][1] = tmp[2][2] = 0;
}

void res_upd()
{
    for(int j = 1 ; j <= 2 ; j++){
        for(int k = 1 ; k <= 2 ; k++){
            tmp[1][j] += base[k][j] * res[1][k] % mod;
            //base[1][j] %= mod;
        }
    }
    
    for(int j = 1 ; j <= 2 ; j++){
        res[1][j] = tmp[1][j] % mod;
    }
    
    tmp[1][1] = tmp[1][2] = tmp[2][1] = tmp[2][2] = 0; 
}

void matrix_ksm(ll k)
{
    while(k)
    {
        if(k & 1){
            res_upd();    
        }
        base_upd();
        
        k >>= 1;
    }
}

ll solve(ll x)
{
    base[1][1] = base[1][2] = base[2][1] = 1;
    res[1][1] = res[1][2] = 1;
    
    ll ans;
    
    if(x == 1 || x == 2){
        ans = 1;
    }else{
        matrix_ksm(x - 2);
        ans = res[1][1];
    }
    
    return ans;
}

int main(){
    
    cin >> a >> b;
    
    ll k = __gcd(a, b);
    
    cout << solve(k) << endl;
    
    return 0;
}