Cod sursa(job #1733958)
| Utilizator | Data | 26 iulie 2016 11:16:03 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#define ll long long
using namespace std;
ll gcd(ll a,ll b,ll &x,ll &y) {
if(b==0) {
x=1;
y=0;
return a;
}
ll x1,y1,d=gcd(b,a%b,x1,y1);
x=y1;
y=x1-(a/b)*y1;
return d;
}
int main()
{
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
int t;
ll a,b,c,d,x,y;
fin>>t;
for(int i=1;i<=t;i++) {
fin>>a>>b>>c;
x=0,y=0;
d=gcd(a,b,x,y);
fout<<d<<'\n';
if(c%d==0)
fout<<x*(c/d)<<" "<<y*(c/d)<<'\n';
else
fout<<"0 0\n";
}
return 0;
}
