Cod sursa(job #904773)
Utilizator | Data | 4 martie 2013 20:40:40 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,k,a,b,x,y,d,c;
void gcd(int a,int b,int &x,int &y)
{
if (!b) { x=1;y=0;d=a;return;}else
{
int x1,y1;
gcd(b,a%b,x1,y1);
x=y1;
y=x1-y1*(a/b);
}
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d %d %d",&a,&b,&c);
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;
}