Cod sursa(job #2088533)
Utilizator | Data | 15 decembrie 2017 14:25:45 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.72 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("euclid3.in");
ofstream fout ("euclid3.out");
int cmmdc(int a,int b)
{
int aux;
while (b!=0)
{
aux=a%b;
a=b;
b=aux;
}
return a;
}
int main()
{
long long T,a,x,b,y,c,d,n,m,im;
fin>>T;
for (int i=1;i<=T;i++)
{
fin>>a>>b>>c;
d=cmmdc(a,b);
n=a/d;
m=b/d;
im=c/d;
x=0;
if (c%d>0)
fout<<0<<" "<<0<<'\n';
else
{
while ((1-n*x)%m!=0)
x++;
y=(1-n*x)/m;
fout<<x*im<<" "<<y*im;
fout<<'\n';
}
}
return 0;
}