Cod sursa(job #2848054)
Utilizator | Data | 12 februarie 2022 09:35:55 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 1.41 kb |
#include <iostream>
using namespace std;
int a,b,c,x,y,n,d;
int cmmdc(int a,int b)
{
int r=a%b;
while(r)
{
a=b;
b=r;
r=a%b;
}
return b;
}
void euclid (int a,int b,int &d,int &x,int &y)
{
if(b==0)
{
d=a;
x=1;
y=0;
}
else
{
int x0,y0;
euclid(b,a%b,d,x0,y0);
x=y0;
y=x0-(a/b)*y0;
}
}
int main()
{
cin>>n;
for(int i=1;i<=n;i++)
{
cin>>a>>b>>c;
d=cmmdc(a,b);
if(c%d==0)
{
x=y=0;
euclid(a,b,d,x,y);
x*=c/d;
y*=c/d;
while(x>2000000000||y<-2000000000)
{
if(b>0)
{
x-=b/d;
y+=a/d;
}
else
{
x+=b/d;
y-=a/d;
}
}
while(x<-2000000000||y>2000000000)
{
if(b>0)
{
x+=b/d;
y-=a/d;
}
else
{
x-=b/d;
y+=a/d;
}
}
cout<<x<<' '<<y<<'\n';
}
else
{
cout<<0<<' '<<0<<'\n';
}
}
return 0;
}