Cod sursa(job #2181061)
Utilizator | Data | 21 martie 2018 13:47:28 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
void euclid(long long a,long long b,long long &x,long long &y)
{
if(b==0)
{
x=1,y=0;
return;
}
long long x0,y0;
euclid(b,a%b,x0,y0);
x=y0;
y=x0-(a/b)*y0;
}
int main()
{
long long a,n,x,y;
fin>>a>>n;
euclid(a,n,x,y);
x=(x%n);
x=(x+n)%n;
fout<<x;
return 0;
}