Cod sursa(job #2375385)
Utilizator | Data | 8 martie 2019 08:46:51 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
long long a,mod;
void euclid(int a,int b,int &x,int &y){
if(b==0){
x=1;
y=0;
return ;
}
int x0,y0;
euclid(b,a%b,x0,y0);
x=y0;
y=x0-y0*(a/b);
return;
}
int main()
{
fin>>a>>mod;
int x,y;
euclid(a,mod,x,y);
fout<<(x+mod)%mod;
}