Cod sursa(job #2374557)
| Utilizator | Data | 7 martie 2019 19:20:47 | |
|---|---|---|---|
| Problema | Algoritmul lui Euclid extins | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.69 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int n, a, b, c, cmmdc, k ,l;
void solve(int a, int b, int &k, int &l)
{
if (b==0)
{
cmmdc=a;
k=1;
l=0;
return;
}
int kp,lp;
solve(b,a%b,kp,lp);
k=lp;
l=kp-lp*(a/b);
}
int main()
{
f >> n;
for (int i=1; i<=n; ++i)
{
f >> a >> b >> c;
solve(a,b,k,l);
if (c%cmmdc==0){
k=k*(c/cmmdc);
l=l*(c/cmmdc);
g << k <<' ' << l << '\n';
}
else
{
g << 0 <<' ' << 0 << '\n';
}
}
return 0;
}
