Cod sursa(job #2355439)
| Utilizator | Data | 26 februarie 2019 08:54:47 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
pair<int,int> keter(int a, int b){
if(b==0)
return {1,0};
auto p = keter(b, a%b);
return {p.second, p.first-a/b*p.second};
}
int main() {
int n;
fin>>n;
for(int i=0;i<n;i++){
int a,b,c;
fin>>a>>b>>c;
auto p = keter(a,b);
int x = p.first, y = p.second;
int d = a*x + b*y;
if(c%d)
cout<<"0 0\n";
else
cout<< x * (c/d) << " " << y * (c/d)<< "\n";
}
return 0;
}