Pagini recente » Cod sursa (job #3327637) | Cod sursa (job #3355663) | Cod sursa (job #3327722) | Cod sursa (job #3344244) | Cod sursa (job #3344543)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("inversmodular.in");
ofstream fout("inversmodular.out");
int z,t;
int euclid(long long a,long long b,long long& x,long long& y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
long long x1,y1;
long long d=euclid(b,a%b,x1,y1);
x=y1;
y=x1-y1*(a/b);
return d;
}
int invmod(long long a,long long m)
{
long long x,y;
long long d=euclid(a,m,x,y);
if(d!=1)
return -1;
else
return (x%m+m)%m;
}
int main()
{
fin >> z >> t;
fout << invmod(z,t);
return 0;
}