Cod sursa(job #1892577)
Utilizator | Data | 25 februarie 2017 09:48:19 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.74 kb |
#include <cstdio>
using namespace std;
int t,a,b,c,x,y,k,l,d;
void euclid(int a, int b, int &k, int &l, int &d)
{
if(b==0)
{
l=1;
k=0;
d=a;
return;
}
int k1, l1, d1;
euclid(b, a%b, k1, l1, d1);
l=k1;
k=l1-(a/b)*k1;
d=d1;
}
int main()
{
freopen("euclid3.in", "r", stdin);
freopen("euclid3.out", "w", stdout);
scanf("%d", &t);
for(int i=0; i<t; i++)
{
scanf ("%d %d %d",&a,&b,&c);
euclid (a,b,k,l,d);
if(c%d==0)
{
x=l*(c/d);
y=k*(c/d);
}
else
{
x=0;
y=0;
}
printf ("%d %d\n",x,y);
}
return 0;
}