이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#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;
}
for (I i=2;i<5000;i++)
for(I j=i+1;j<=5000;j++)
{
if (__gcd(i,j)==g&&edicul(i,j)==h)
cout<<i<<" "<<j<<nl;
return;
}
}
int main()
{
ios::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin>>t;
while(t--)
DeoACLamCho();
}
컴파일 시 표준 에러 (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... |