Cod sursa(job #1111360)
Utilizator | Data | 18 februarie 2014 20:20:23 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,k,c,a,b;
int gcd(int a,int b,int &x,int &y)
{
if (b==0) { x=1;y=0;return a;}
int x0,y0,d;
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);
scanf("%d",&k);
for (i=1;i<=k;i++)
{
scanf("%d %d %d",&a,&b,&c);
int x,y,d;
d=gcd(a,b,x,y);
if (c%d) printf("0 0\n");else
printf("%d %d\n",x*(c/d),y*(c/d));
}
return 0;
}