This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define TASK C
#define I int
#define ll long long
#define ld long double
#define ull unsigned ll
#define nl '\n'
#define debug(a,n) \
for (I i=1;i<=(n);i++) \
cout<<(a)[i]<<" "; \
cout<<nl;
#define idebug(a,n) \
for (I i=n;i>=1;i--) \
cout<<(a)[i]<<" "; \
cout<<nl;
#define debug2(a,n) \
for (I i=1;i<=(n);i++) \
cout<<(a)[i].first<<" <<(a)[i].second<<nl;
#define idebug2(a,n) \
for (I i=n;i>=1;i--) \
cout<<(a)[i].first<<" <<(a)[i].second<<nl;
using namespace std;
const I vpn=1e6;
I t;
ll a,b,g,h;
map<pair<ll,ll>,pair<ll,ll>> nho;
ll edicul(ll a,ll b)
{
if (a<b)
return edicul(b,a);
if (b>1)
return edicul(a/b,b);
return a;
}
void DeoACLamCho()
{
cin>>g>>h;
if (g==h)
{
cout<<g<<" "<<h<<nl;
return;
}
if (h==2)
{
cout<<g<<" "<<2*g<<nl;
return;
}
if (g==h*h)
{
cout<<g<<" "<<g*h<<nl;
return;
}
if (g>h)
{
cout<<g<<" "<<g*h<<nl;
return;
}
cout<<nho[{g,h}].first<<" "<<nho[{g,h}].second<<nl;
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
for(I i=2;i<=3000;i++)
for(I j=2;j<=3500;j++)
if (nho[{__gcd(i,j),edicul(i,j)}].first==0)
nho[{__gcd(i,j),edicul(i,j)}]={i,j};
cin>>t;
while(t--)
DeoACLamCho();
}
Compilation message (stderr)
euklid.cpp:18:25: warning: missing terminating " character
18 | cout<<(a)[i].first<<" <<(a)[i].second<<nl;
| ^
euklid.cpp:21:25: warning: missing terminating " character
21 | cout<<(a)[i].first<<" <<(a)[i].second<<nl;
| ^
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |