Cod sursa(job #1502922)
| Utilizator | Data | 15 octombrie 2015 10:56:23 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.97 kb |
#include<fstream>
using namespace std;
long long a,b,c,d;
long long cmmdc(long long a, long long b) {
if (b==0) return a;
else return cmmdc(b,a%b);
}
long long euclid(long long &x, long long &y, long long a, long long b) {
if (b==0) {
x=1;
y=0;
}
else {
long long xp,yp;
euclid(xp,yp,b,a%b);
x=yp;
y=xp-(a/b)*yp;
}
}
int main(void) {
ifstream cin("euclid3.in");
ofstream cout("euclid3.out");
int t;
cin>>t;
for (; t; --t) {
cin>>a>>b>>c;
d=cmmdc(a,b);
if (c%d==0) {
long long x,y;
euclid(x,y,a,b);
cout<<(c/d)*x<<" "<<(c/d)*y<<"\n";
}
else cout<<"0 0\n";
}
return 0;
}
