Cod sursa(job #1439727)
Utilizator | Dont Blink UPB_Radu_Stefan_Silviu | Data | 23 mai 2015 00:20:32 |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <cstdio>
using namespace std;
int T, A, B, C, D;
int Euclid(int A, int B, int &X, int &Y)
{
if(!B)
{
X = 1, Y = 0;
return A;
}
int Xp, Yp, D = Euclid(B, A % B, Xp, Yp);
X = Yp;
Y = Xp - (A / B) * Yp;
return D;
}
int main()
{
freopen("euclid3.in", "r", stdin);
freopen("euclid3.out", "w", stdout);
scanf("%i", &T);
for(; T; T --)
{
scanf("%i %i %i", &A, &B, &C);
int X, Y, D = Euclid(A, B, X, Y);
if(C % D) printf("0 0\n");
else printf("%i %i\n", X * (C / D), Y * (C / D));
}
}