Cod sursa(job #2873553)
Utilizator | Data | 19 martie 2022 10:54:58 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
#define MOD 1999999973
void euclid(int a, int b, int &d, int &x, int &y)
{
if(b == 0)
{
x = 1;
y = 0;
d = a;
return;
}
int x1, y1;
euclid(b, a%b, d, x1, y1);
x = y1;
y = x1 - (a/b)*y1;
}
int main()
{
int n,d,x,y;
fin>>n;
for(int i=1;i<=n;i++)
{
long long a,b,c;
fin>>a>>b>>c;
euclid(a,b,d,x,y);
if(c%d)
fout<<"0 0\n";
else
fout<<x*(c/d)<<' '<<y*(c/d)<<'\n';
}
return 0;
}