Cod sursa(job #1949805)
Utilizator | Data | 2 aprilie 2017 13:35:14 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <cstdio>
using namespace std;
int n, MOD;
void citire()
{
scanf("%d %d", &n, &MOD);
}
void euclidExtins(int a, int b, int &x, int &y)
{
if(b == 0)
{
x = 1;
y = 0;
}
else
{
euclidExtins(b, a % b, x, y);
int tmp = x;
x = y;
y = tmp - (a / b) * y;
}
}
void solve()
{
int x, y;
euclidExtins(MOD, n, x, y);
while(y < 0)
{
y += MOD;
}
printf("%d", y);
}
int main()
{
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
citire();
solve();
return 0;
}