Pagini recente » Cod sursa (job #2615126) | Cod sursa (job #2342760) | Cod sursa (job #1432300) | Cod sursa (job #541717) | Cod sursa (job #2788639)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int main()
{
int a[50],b[50],A,B,C,n=0,x0,y0,x,y, T;
f>>T;
for(int i=0; i<T; i++)
{
f>>A>>B>>C;
n=0;
a[0]=A,b[0]=B;
while(b[n])
{
n++;
a[n]=b[n-1];
b[n]=a[n-1]%b[n-1];
}
if(C%a[n])
g<<0<<" "<<0<<"\n";
else
{
x0=C/a[n];
y0=0;
while(n)
{
n--;
x=y0;
y=x0-a[n]/b[n]*y0;
x0=x;
y0=y;
}
g<<x0<<" "<<y0<<"\n";
}
}
return 0;
}