Cod sursa(job #2476586)
| Utilizator | Data | 19 octombrie 2019 09:52:47 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
void euclid(int x,int y,int &d,int &k,int &l)
{
int kp,lp;
if(y==0)
{
l=0;
k=1;
d=x;
return;
}
euclid(y,x%y,d,kp,lp);
k=lp;
l=kp-(x/y)*lp;
}
void citireafisare()
{
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
int t,a,b,c,d,x,y;
fin>>t;
for(int i=0;i<t;i++)
{
fin>>a>>b>>c;
euclid(a,b,d,x,y);
if(c%d)
fout<<"0 0\n";
else
{
x=x*(c/d);
y=y*(c/d);
fout<<x<<" "<<y<<"\n";
}
}
}
int main()
{
citireafisare();
return 0;
}
