Cod sursa(job #3001355)
Utilizator | Data | 13 martie 2023 15:51:22 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long a,n;
void euclid_ext(int a,int b,int &x,int &y)
{
if(b==0)
{
x=1,y=1;
}
else{
int x1,y1;
euclid_ext(b,a%b,x1,y1);
x=y1;
y=x1-a/b*y1;
}
}
int main()
{
f>>a>>n;
int x,y;
euclid_ext(a,n,x,y);
while(x<0)
x+=n;
g<<x;
return 0;
}