Cod sursa(job #2040791)
Utilizator | Data | 16 octombrie 2017 15:57:20 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.61 kb |
#include <cstdio>
using namespace std;
int x,y,n,d,k,l,c;
void cmmdc(int x,int y,int &d,int &k,int &l)
{
if(y==0)
{
k=1;
l=0;
d=x;
return;
}
int k1,l1;
cmmdc(y,x%y,d,k1,l1);
k=l1;
l=k1-l1*(x/y);
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d %d %c",&x,&y,&c);
cmmdc(x,y,d,k,l);
if(c%d != 0)
printf("%d %d\n",k*(c/d),l*(c/d));
else
printf("0 0\n");
}
return 0;
}