Cod sursa(job #2224939)
| Utilizator | Data | 25 iulie 2018 16:33:20 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int t,a,b,c,d,x,y,GCD(int,int,int&,int&);
int main()
{
f>>t;
for(;t;t--)
{
f>>a>>b>>c;
d=GCD(a,b,x,y);
if(c%d)
{
g<<"0 0\n";
continue;
}
else
{
x*=c/d;
y*=c/d;
g<<x<<' '<<y<<'\n';
}
}
return 0;
}
int GCD(int a,int b,int &x,int &y)
{
if(b==0){x=1;y=0;return a;}
int X,Y,D;
D=GCD(b,a%b,X,Y);
x=Y;
Y=X-(a/b)*Y;
return D;
}
