Cod sursa(job #671725)
Utilizator | SAlexandru BitOne | Data | 31 ianuarie 2012 20:16:32 |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <cstdlib>
using namespace std;
inline void gcd( int x, int y, int& x0, int& y0, int& d )
{
if( !y )
{
d=x;
x0=1;
y0=0;
return;
}
int a, b;
gcd( y, x%y, a, b, d );
x0=b;
y0=a-(x/y)*b;
}
int main( void )
{
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;
}