Cod sursa(job #2490101)
| Utilizator | Data | 9 noiembrie 2019 19:20:49 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include<fstream>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
long long a,b,c,D,n,x,y;
long long cmmdc(long long a,long long b,long long &x,long long &y){
if(b==0){
x=1;
y=0;
return a;
}
else{
long long X,Y,r=cmmdc(b,a%b,X,Y);
x=Y;
y=X-Y*(a/b);
return r;
}
}
int main(){
fin>>n;
for(int i=1;i<=n;i++){
fin>>a>>b>>c;
D=cmmdc(a,b,x,y);
if(c%D==0){
fout<<c/D*x<<" "<<c/D*y<<"\n";
}
else{
fout<<"0 0"<<"\n";
}
}
return 0;
}
