Cod sursa(job #1892654)
| Utilizator | Data | 25 februarie 2017 10:42:17 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <cstdio>
using namespace std;
///Euclid extins si x e a-1
///^^^^^^^^^^^^^^^^^^^^^^^^
int a, n, k, l;
void EuclidExtins(int a, int b, int &k, int &l)
{
if(b==0)
k=1, l=0;
else
{
int kp, lp;
EuclidExtins(b, a%b, kp, lp);
k=lp;
l=kp-lp*(a/b);
}
}
void Citire()
{
freopen("inversmodular.in", "r", stdin);
freopen("inversmodular.out", "w", stdout);
scanf("%d %d", &a, &n);
EuclidExtins(a, n, k, l);
cout<<k;
}
int main()
{
Citire();
return 0;
}
