Submission #66668797

---

Source Code Expand

#if __has_include("pch.hpp")
#include "pch.hpp"
#else
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
//#include <atcoder/segtree>
#endif
using namespace std;
//using namespace atcoder;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
using namespace __gnu_pbds;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> order_set;
mt19937_64 mt_rand(chrono::high_resolution_clock::now().time_since_epoch().count());
//ld rand(ld a, ld b) {uniform_real_distribution<ld> uni(a, b); return uni(mt_rand);}
//const ld PI=3.141592653589793238462643383279;
const int mxN=1e6+50000;
const int mod=1e9+7;
const int mxlogN=19;
const ll inf=1e18;
const int iinf=1e9;
const int K=60;
pair<ll,ll> solve(ll a, ll b, ll c, ll d)
{
    ll f=a/b;
    if(f)
    {
        auto [p,q]=solve(a-b*f,b,c-d*f,d);
        p+=q*f;
        return {p,q};
    }
    if(c>d) return {1,1};
    auto [p,q]=solve(d,c,b,a);
    return {q,p};
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int t; cin >> t;
    while(t--)
    {
        ll a,b,c,d; cin >> a >> b >> c >> d;
        cout << solve(a,b,c,d).second << "\n";
    }
}

Submission Info

Judge Result