Cod sursa(job #2715271)
| Utilizator | Data | 3 martie 2021 14:11:10 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.66 kb |
#include <fstream>
using namespace std;
int extended_euclid(int a,int b,int *x,int *y)
{
if(!a)
{
*x=0;
*y=1;
return b;
}
int x1,y1;
int lnko=extended_euclid(b%a,a,&x1,&y1);
*x=y1-(b/a)*x1;
*y=x1;
return lnko;
}
int main()
{
ifstream be("euclid3.in");
ofstream ki("euclid3.out");
int n;
be>>n;
for(int i=0;i<n;i++)
{
int a,b,c;
be>>a>>b>>c;
int x,y;
int d=extended_euclid(a,b,&x,&y);
if(c%d==0)
{
ki<<x*(c/d)<<" "<<y*(c/d);
}
else ki<<0<<" "<<0;
ki<<endl;
}
return 0;
}
