Cod sursa(job #662950)
| Utilizator | Data | 17 ianuarie 2012 14:11:58 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int n,i,a,b,c,x,y,d;
void euclext (int a, int b, int &d, int &x, int &y)
{
int x0, y0;
if (b==0)
{
d=a;
x=1;
y=0;
}
else
{
euclext(b,a%b,d,x0,y0);
x=y0;
y=x0-(a/b)*y0;
}
}
int main ()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>a>>b>>c;
euclext (a,b,d,x,y);
if (c%d==0) g<<x*(c/d)<<' '<<y*(c/d)<<'\n';
else
g<<0<<' '<<0<<'\n';
}
return 0;
}
