Mai intai trebuie sa te autentifici.
Cod sursa(job #1939155)
| Utilizator | Data | 25 martie 2017 15:04:10 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include<fstream>
#define DMAX 1300001
using namespace std;
ifstream f("euclid3.in"); ofstream g("euclid3.out");
int T,a,b,c,d,i;
long long x,y;
inline int euclidextins( int A, int B, long long &X, long long &Y )
{int D; long long X0,Y0;
if(B == 0) {X = 1; Y = 0; return A;}
D=euclidextins(B,A%B,X0,Y0 );
X = Y0;
Y = X0 - (A / B) * Y0;
return D;
}
int main()
{f>>T;
for(i=1; i<=T; i++)
{f>>a>>b>>c; //g<<a<<' '<<b<<' '<<c<<'\n';
d=euclidextins(a,b,x,y);
if (c % d) g<<"0 0\n"; else g<<x*(c/d)<<' '<< y*(c/d)<<'\n';
}
g.close(); return 0;
}
