Cod sursa(job #1631575)
| Utilizator | Data | 5 martie 2016 17:07:30 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <stdio.h>
using namespace std;
int k,m,n,p;
int euclid(int a, int b, int &x,int &y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
int x0,y0,d;
d=euclid(b,a%b,x0,y0);
x=y0;
y=x0-(a/b)*y0;
return d;
}
void citire()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
scanf("%d",&k);
for(int i=0;i<k;i++)
{
scanf("%d %d %d",&m,&n,&p);
int x,y,d;
d=euclid(m,n,x,y);
if(p%d)
printf("0 0");
else
printf("%d %d\n",x*(p/d),y*(p/d));
}
}
int main()
{
citire();
return 0;
}
