/ SeriousOJ /

Record Detail

Memory Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 320.0 KiB
#2 Time Exceeded ≥1087ms ≥6.336 MiB
#3 Memory Exceeded ≥1136ms ≥256.016 MiB
#4 Memory Exceeded ≥1140ms ≥256.016 MiB
#5 Memory Exceeded ≥1156ms ≥256.016 MiB
#6 Memory Exceeded ≥1160ms ≥256.016 MiB

Code

#include <iostream>
#include<numeric>
#include<algorithm>
#include<deque>
using namespace std;

#define ll long long int
#define ld long double
#define endl '\n'
#define MIR183_Mac ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define yes cout << "YES" << endl
#define no cout << "NO" << endl



void solve() {
    // Your code here
    ll a,b;
    cin>>a>>b;


    // ll x=gcd(a,b);
    // ll y=lcm(a,b);
    // cout<<x<<" "<<y<<endl;
    deque<deque<ll>>v(a+1,deque<ll>(b+1,0));
    for(ll i=1;i<=a;i++){
        for(ll j=1;j<=b;j++){
            v[i][j]=gcd(i,j);
        }
    }
    ll ans=0;
    for(ll i=1;i<=a;i++){
        for(ll j=1;j<=b;j++){
            ll gcdij=v[i][j];
            ll lcmij=(i*j)/gcdij;
            if(gcdij!=lcmij) ans++;
        }
    }
    cout<<ans<<endl;
    // ans=0;

}

signed main() {
    MIR183_Mac;
    // Always use ll, int may give TLE
    ll tt;
    // tt=1;
    cin >> tt;
    while (tt--) {
        solve();
    }
    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:55:43
Judged At
2024-10-03 13:09:46
Judged By
Score
10
Total Time
≥1160ms
Peak Memory
≥256.016 MiB