/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Accepted 1ms 324.0 KiB
#3 Accepted 4ms 660.0 KiB
#4 Accepted 24ms 1.395 MiB
#5 Accepted 29ms 2.027 MiB
#6 Accepted 28ms 2.125 MiB

Code

#include<bits/stdc++.h>
//#include<ext/pb_ds/assoc_container.hpp>
//#include<ext/pb_ds/tree_policy.hpp>

//using namespace __gnu_pbds;
using namespace std;

typedef long long int ll ;
//typedef __int128 lll;
#define pb push_back
#define pinf   2e18
#define ninf   -2e18
#define PI    acos(-1.0)
#define endl  "\n"
#define F first
#define S second

//template <typename T> using o_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

ll gcd (ll a,ll b) {
    if(a%b==0)return b;
    return gcd(b,a%b);
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    //inout() ;

    ll t,i,j ;
    cin>>t ;
    while(t--) {
        ll a,b,n;
        cin>>a>>b;
        ll mn=min(a,b);
        ll mx=abs (a-b);
        ll ans=(mn *(mn-1));
        ans= ans + (mn* mx);
        
        cout<<ans<<'\n';





    }
    return 0 ;
}

Information

Submit By
Type
Submission
Problem
P1075 GCD not equal LCM
Contest
Brain Booster #5
Language
C++20 (G++ 13.2.0)
Submit At
2024-09-05 15:40:15
Judged At
2024-10-03 13:10:56
Judged By
Score
100
Total Time
29ms
Peak Memory
2.125 MiB