Cod sursa(job #2656731)
| Utilizator | Data | 8 octombrie 2020 16:02:43 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int t, a, b, c, d;
pair<int, int> euclidExtins(int x, int y)
{
if(y == 0)
{
d=x;
return {1, 0};
}
auto p=euclidExtins(y ,x%y);
return {p.second, p.first-(x/y)*p.second};
}
int main()
{
f>>t;
for(int i=1; i<=t; i++)
{
f>>a>>b>>c;
d=0;
auto p=euclidExtins(a, b);
if(c%d == 0)
g<<p.first*(c/d), p.second*(c/d)<<'\n';
else
g<<0<<' '<<0<<'\n';
}
return 0;
}
