/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 2ms 324.0 KiB
#3 Wrong Answer 21ms 576.0 KiB
#4 Wrong Answer 195ms 1.336 MiB
#5 Wrong Answer 193ms 2.109 MiB
#6 Wrong Answer 200ms 2.016 MiB

Code


#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long int ll;


using namespace std;
using namespace __gnu_pbds;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define mod 1000000007

ll lcm(ll a,ll b)
{
    return (a*b)/__gcd(a,b);
}


ll binExp(ll a,ll b)
{
    if(b==0)
        return 1;

    ll res=binExp(a,b/2);

    if(b&1)
    {
        return (a*res*res)%mod;

    }
    else
    {
        return (res*res)%mod;
    }
}


bool isPrime(ll n)
{
    for(ll i=2; i*i<=n; i++)
    {
        if(n%i==0)
        {
            return false;
        }
    }

    return true;
}




void solve()
{
   ll a,b;
   cin>>a>>b;

   ll temp=min(a,b);

   cout<<temp*temp<<endl;


}















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





    ll t;

    cin>>t;
  //  t=1;






    ll caseNo=1;



    while(t--)
    {
        //  cout<<"Case "<<caseNo<<": ";
        // caseNo++;

        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:40:31
Judged At
2024-10-03 13:10:51
Judged By
Score
10
Total Time
200ms
Peak Memory
2.109 MiB