Cod sursa(job #2107379)
Utilizator | Data | 17 ianuarie 2018 09:11:28 | |
---|---|---|---|
Problema | Algoritmul lui Euclid extins | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream in("inversmodular.in");
ofstream out("inversmodular.out");
void gcd(long long int &x,long long int &y, int a, int b)
{
if(!b)
{
x=1;
y=0;
}
else
{
gcd(x,y,b,a%b);
long long aux=x;
x=y;
y=aux-y*(a/b);
}
}
int main()
{
int A,N;
long long inv, ins;
in>>A>>N;
gcd(inv,ins,A,N);
if(inv<=0) inv+=N;
out<<inv;
return 0;
}