/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 540.0 KiB
#2 Accepted 2ms 544.0 KiB
#3 Accepted 4ms 616.0 KiB
#4 Accepted 24ms 1.387 MiB
#5 Accepted 29ms 2.02 MiB
#6 Accepted 53ms 2.227 MiB

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define MOD 1000000007
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define F first
#define S second
#define yes cout<<"YES"<<'\n';
#define no cout<<"NO"<<'\n';
#define endl "\n"
#define all(v) v.begin(),v.end()
#define print(v) for(auto it:v) cout<<it<<" "; cout<<endl;
#define srt(v) sort(v.begin(),v.end());
#define rsrt(v) sort(v.rbegin(),v.rend());
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*b)/gcd(a,b)
#define PI 2*acos(0.0)
#define pr pair<int,int>
#define Tasrik ios_base::sync_with_stdio(0);  cin.tie(0); cout.tie(0);

int main ()
{
    Tasrik;
    ll t=1,n,a,b;
    cin>>t;
    while(t--)
    {
        cin>>a>>b;

        ll x=(a*b)-min(a,b);
        cout<<x<<endl;
    }
}


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:56:56
Judged At
2024-09-05 15:56:56
Judged By
Score
100
Total Time
53ms
Peak Memory
2.227 MiB