/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 24ms 612.0 KiB
#3 Accepted 24ms 608.0 KiB
#4 Accepted 24ms 584.0 KiB
#5 Accepted 23ms 592.0 KiB
#6 Accepted 21ms 568.0 KiB
#7 Accepted 22ms 576.0 KiB
#8 Accepted 21ms 568.0 KiB
#9 Accepted 24ms 616.0 KiB
#10 Accepted 24ms 624.0 KiB

Code

//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; while (t--)
const int N = 1e9 + 7;
using namespace std;
void s()
{

    vector<int>v(3);
    for(int i=0;i<3;i++) {
        cin >> v[i];
    }
    sort(all(v));
    int dif1 = abs(v[1] - v[0]);
    int dif2 = abs(v[2] - v[1]);
    int mn = min(dif1,dif2);
    int mx = max(dif1,dif2);
    if(mn == 0 && mx == 0) {
        cout << "0" << endl;
    }
    else {
        int g = gcd(mn,mx);
        if(mn == 0) {
            cout << "1" << endl;
        }
        else {
            cout << (mn/g) + (mx/g) << endl;
        }
    }

}
int32_t main()
{   ios::sync_with_stdio(false);

    TC
    s();


}




Information

Submit By
Type
Submission
Problem
P1061 Bring equality
Contest
Brain Booster #4
Language
C++20 (G++ 13.2.0)
Submit At
2024-07-14 17:01:47
Judged At
2024-10-03 13:36:29
Judged By
Score
100
Total Time
24ms
Peak Memory
624.0 KiB