Cod sursa(job #3123223)
| Utilizator | Data | 22 aprilie 2023 15:24:14 | |
|---|---|---|---|
| Problema | Invers modular | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long int a,n,x,y;
void euclidex(long long int a,long long int b,long long int &x,long long int &y)
{
if (b==0)
{
x=1;
y=1;
}
else
{
long long int xnou,ynou;
euclidex(b,a%b,xnou,ynou);
x=ynou;
y=xnou-a/b*ynou;
}
}
int main()
{
f>>a>>n;
euclidex(a,n,x,y);
while(x<0)
{
x+=n;
}
g<<x;
return 0;
}
