Cod sursa(job #2479820)
Utilizator | Data | 24 octombrie 2019 16:33:59 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");
int t,a,b,c,d;
pair<long long int,long long int> eucl_extins(int x,int y)
{
if(y==0)
{
d=x;
return {1,0};
}
auto p=eucl_extins(y,x%y);
return {p.second,p.first-(x/y)*p.second};
}
int main()
{
f>>t;
for(int i=0;i<t;i++)
{
f>>a>>b>>c;
auto p=eucl_extins(a,b);
if(c%d==0)
{
cout<<p.first*(c/d)<<" "<<p.second*(c/d)<<endl;
}
else
cout<<0<<" "<<0<<endl;
}
return 0;
}