Cod sursa(job #2155489)
Utilizator | Data | 7 martie 2018 21:12:39 | |
---|---|---|---|
Problema | Invers modular | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
void euclid(long long &x,long long &y,int a, int b)
{
if(b==0)
{
x=1;
y=0;
}
else
{
euclid(x,y,b,a%b);
long long q=x;
x=y;
y=q-y*(a/b);
}
}
long long r,t;
int n,m;
int main()
{
f>>n>>m;
euclid(r,t,n,m);
if(r<=0)
r=m+r%m;
g<<r;
return 0;
}