Cod sursa(job #2873536)
Utilizator | Tisca Catalin indianu_talpa_iute | Data | 19 martie 2022 10:51:28 |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <bits/stdc++.h>
#define LL long long
using namespace std;
ifstream fin("euclid3.in");
ofstream fout("euclid3.out");
pair<LL, LL> euclid(LL a, LL b) {
if (b == 0)
return {1, 0};
auto p = euclid(b, a % b);
return {p.second, p.first - (a / b) * p.second};
}
int main() {
int t;
fin >> t;
for (int i = 0; i < t; i++) {
LL a, b, c;
fin >> a >> b >> c;
auto res = euclid(a, b);
fout << res.first << ' ' << res.second << '\n';
}
return 0;
}