Cod sursa(job #1524470)
Utilizator | Data | 14 noiembrie 2015 09:57:39 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
using namespace std;
int n,a,b,c,d,i,x,y,z;
int gcd(int a,int b)
{
if (b==0) { x=1; y=0; return a; } else
{
int l=gcd(b,a%b);
z=x; x=y;
y=z-(a/b)*y;
return l;
}
}
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); x=y=z=0; d=gcd(a,b);
if (c%d!=0) printf("0 0\n"); else
printf("%d %d\n",x*(c/d),y*(c/d));
}
return 0;
}