Cod sursa(job #2151682)
Utilizator | Data | 4 martie 2018 19:02:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int t,a,b,c;
inline int gcd(int a, int b, int &x, int &y) {
if(b==0)
{
x=1;
y=0;
return a;
}
int x1,y1,d=gcd(b,a%b,x1,y1);
x=y1;
y=x1-(a/b)*y1;
return d;
}
int main()
{
int x,y,d;
f>>t;
while(t--)
{
f>>a>>b>>c;
d=gcd(a,b,x,y);
if(c%d)
g<<"0 0\n";
else
g<<x*(c/d)<<" "<<y*(c/d)<<"\n";
}
return 0;
}