#include<bits/stdc++.h>
using namespace std;
#define int long long
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
const int N=2e6+7;
const double eps=1e-8;
const int mod=1e9+7;
const int inf=0x7fffffff;
const double pi=3.1415926535;
int yz[N];
using namespace std;
int gcd(int a,int b)
{
return b?gcd(b,a%b):a;
}
int exgcd(int a,int b,int &x,int &y)
{
if(!b)
{
x=1;
y=0;
return a;
}
int d=exgcd(b,a%b,x,y);
int t=x;
x=y;
y=t-(a/b)*y;
return d;
}
void init()
{
int sqr=sqrt(N);
memset(yz,0,sizeof yz);
for(int i=2;i<=sqr;i++)
{
if(yz[i])
{
continue;
}
for(int j=2;i*j<N;j++)
{
if(yz[i*j]==0)
{
yz[i*j]=i;
}
}
}
}
int a,b,c,d,e,f;
signed main()
{
IOS;
init();
int t;
cin>>t;
while(t--)
{
cin>>a>>b;
a/=gcd(a,b);
b/=gcd(a,b);
int m=a/b;
a%=b;
if(gcd(a,b)!=1)
{
cout<<m+1<<1<<b-a<<b<<endl;
}
else if(!yz[b])
{
cout<<"-1 -1 -1 -1"<<endl;
}
else
{
d=yz[b];
f=b/yz[b];
while(f%yz[b]==0)
{
d*=yz[b];
f/=yz[b];
}
if(f==1)
{
cout<<"-1 -1 -1 -1"<<endl;
}
int x,y;
exgcd(f,d,x,y);
while(x<=0||y>=0)
{
x+=d;
y-=f;
}
cout<<m*d+x*a<<" "<<d<<" "<<-y*a<<" "<<f<<endl;
}
}
return 0;
}
2020牛客暑期多校训练营(第三场)F-Fraction Construction Problem(数论,拓展欧几里得)
最新推荐文章于 2020-08-08 20:03:50 发布