Cod sursa(job #2175074)
Utilizator | Mihalut Filip filip.mihalut | Data | 16 martie 2018 15:06:05 |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("inversmodular.in");
ofstream g ("inversmodular.out");
int x,y,n,mod;
inline void euclidExtins(int a,int b,int &x,int &y)
{
if(b == 0)
{
x = 1,y = 0;
return;
}
int x0,y0; euclidExtins(b,a%b,x0,y0);
x = y0;
y = x0 - (a/b)*y0;
}
int main()
{
f >> n >> mod;
euclidExtins(n,mod,x,y);
if(x < 0)
x = x % mod + mod;
g << x;
return 0;
}