Cod sursa(job #1437152)
Utilizator | Data | 17 mai 2015 00:11:33 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
using namespace std;
#include <fstream>
ifstream f ("euclid3.in");
ofstream g ("euclid3.out");
int gcd (int a, int b, int &x, int &y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
int x0,y0,d;
d=gcd(b,a%b,x0,y0);
x=y0;
y=x0-(a/b)*y0;
return d;
}
int main ()
{
int t=0,a=0,b=0,c=0,d=0,x=0,y=0;
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;
}