Cod sursa(job #2977374)
| Utilizator | Data | 11 februarie 2023 14:24:33 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <bits/stdc++.h>
using namespace std;
int gcd(int A,int B,int &X,int &Y)
{
if(B==0){X=1;Y=0; return A;}
int D,X0,Y0;
D=gcd(B,A%B,X0,Y0);
X=Y0;
Y=X0-(A/B)*Y0;
return D;
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
int n; cin>>n;
while(n--)
{
int a,b,c; cin>>a>>b>>c;
int d,x,y;
d=gcd(a,b,x,y);
if(c%d) cout<<"0 0\n";
else cout<<x*(c/d)<<" "<<y*(c/d)<<"\n";
}
return 0;
}