/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 7ms 580.0 KiB
#3 Accepted 7ms 580.0 KiB
#4 Accepted 6ms 600.0 KiB
#5 Accepted 6ms 616.0 KiB
#6 Accepted 5ms 580.0 KiB
#7 Accepted 5ms 536.0 KiB
#8 Accepted 5ms 532.0 KiB
#9 Accepted 7ms 580.0 KiB
#10 Accepted 7ms 576.0 KiB

Code

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long int
#define vv vector<long long>
#define mpp map<long long,long long>
#define ss set<long long>
#define vp vector<pair<long long, long long>>
#define MOD 1000000007
#define YES cout<<"YES"<<endl
#define NO cout<<"NO"<<endl
#define all_v v.begin(),v.end()
#define all_a a.begin(),a.end()
#define all_n for(int i=0;i<n;i++)
void requisite(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);cout.tie(nullptr);
}
int main() {
    requisite();
    ll t;
    cin>>t;
    while (t--){
        ll a,b,c;
        cin>>a>>b>>c;
        ll s=0;
        ll count=0;
        mpp mp;
        mp[a]++;
        mp[b]++;
        mp[c]++;
        for(auto it:mp){
            if (it.second>s){
                s=it.second;
            }
        }
        if (s==3){
            cout<<0<<endl;
        }
        else if (s==2){
            cout<<1<<endl;
        }
        else{
                ll i= max(a,max(b,c));
                ll j= min(a, min(b,c));
                ll k= a+b+c-i-j;
                ll x= i-k;
                ll y=k-j;
                ll z= gcd(x,y);
                count+=x/z;
                count+=y/z;
                cout<<count<<endl;
        }
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1061 Bring equality
Contest
Brain Booster #4
Language
C++17 (G++ 13.2.0)
Submit At
2024-07-14 16:13:14
Judged At
2024-11-11 03:24:31
Judged By
Score
100
Total Time
7ms
Peak Memory
616.0 KiB