Cod sursa(job #2048771)
Utilizator | Bouruc Petru Liviu BourucLiviu | Data | 26 octombrie 2017 16:12:03 |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream fin ("inversmodular.in");
ofstream fout("inversmodular.out");
inline void Euclid(int a, int b, int &x, int &y)
{
if(b == 0)
{
x = 1;
y = 0;
}
else
{
int x0, y0;
Euclid(b, a%b, x0, y0);
x = y0;
y = x0 - (a/b * y0);
}
}
int inv_modular(int a, int mod)
{
int b = mod;
int x, y;
Euclid(a, b, x, y);
return x;
}
int main()
{
int a, n;
fin >> a >> n;
fin.close();
int x = inv_modular(a, n);
while(x < 0) x += n;
fout << x;
fout.close();
return 0;
}