exgcd

洛谷P1495 【模板】中国剩余定理（CRT）/ 曹冲养猪

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 10;
const int mod = 998244353;
typedef pair<int, int> PII;
int n, m, q, k;
int a[N], b[N];
int exgcd(int a, int b, int &x, int &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    int d = exgcd(b, a % b, y, x);
    y -= (a / b) * x;
    return d;
}

// x = bi (mod ai)
// x = bj (mod aj)

// aj * m1 = bi (mod ai)
// ai * m2 = bj (mod aj)
void solve(){
    cin >> n;
    for(int i = 1; i <= n; i++){
        cin >> a[i] >> b[i];
    }
    int sum = 1;
    for(int i = 1; i <= n; i++){
        sum *= a[i];
    }
    int ans = 0;
    for(int i = 1; i <= n; i++){
        int temp = sum / a[i];
        int x, y;
        int d = exgcd(temp, a[i], x, y);
        ans += (x * (b[i] / d) % (a[i] / d) + (a[i] / d)) % (a[i] / d) * temp ;
    }
    ans %= sum;
    cout << ans << "\n";
}


signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin >> t;
    while(t--){
        solve();
    }
    return 0;
}

Codeforces Round 887 (Div. 2) B. Fibonaccharsis

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 2e5 + 10;
const int mod = 998244353;
typedef pair<int, int> PII;
int n, m, q, k;
int a[N];
int exgcd(int a, int b, int &x, int &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    int d = exgcd(b, a % b, y, x);
    y -= (a / b) * x;
    return d;
}
pair<int, int> b[N];
void init(const int n = 50){
    b[1] = {1, 0};
    b[2] = {0, 1};
    for(int i = 3; i <= n; i++){
        b[i] = {b[i - 1].first + b[i - 2].first, b[i - 1].second + b[i - 2].second};
    }
    
}
void solve(){
    cin >> n >> k;
    if(k > 50){
        cout << 0 << "\n";
        return ;
    }
    if(k <= 2){
        cout << "1\n";
        return ;
    }
    pair<int, int> p = b[k];
    int x = p.first, y = p.second;
    int x1, y1;
    int ans = 0;
    int d = exgcd(x, y, x1, y1);
    if(n % d){
        cout << "0\n";
        return ;
    }
    int en = n / (x + y), be = ((x1 * n / d % (y / d)) + y / d) % (y / d);
    if(en < be){
        cout << "0\n";
        return ;
    }
    cout << (en - be) / (y / d) + 1 << "\n";
}


signed main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    init();
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}