Cod sursa(job #735496)
| Utilizator | Data | 16 aprilie 2012 16:34:33 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
inline void gcd(int a, int b, int& x, int& y, int& d)
{
if(!b)
{
d=a;
x=1;
y=0;
return;
}
int x0, y0;
gcd(b, a%b, x0, y0, d);
x=y0;
y=x0-(a/b)*y0;
}
int main()
{
int T, a, b, c, d, x, y;
ifstream in( "euclid3.in" );
ofstream out( "euclid3.out" );
for(in>>T; T; --T)
{
in>>a>>b>>c;
gcd(a, b, x, y, d);
if( c%d )
out<<"0 0\n";
else c/=d, out<<(c*x)<<' '<<(c*y)<<'\n';
}
return EXIT_SUCCESS;
}
