Pagini recente » Cod sursa (job #331962) | Cod sursa (job #1249333) | Cod sursa (job #1612241) | Cod sursa (job #2278402) | Cod sursa (job #1098576)
#include <fstream>
using namespace std;
long long a,n,inv,ins;
void euclid(int a,int b,long long &x,long long&y)
{
long long aux;
if (b!=0)
x=1,y=0;
else
{
euclid(b,a%b,x,y);
aux=x;
x=y;
y=aux-y*(a/b);
}
}
int main()
{
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
f>>a>>n;
euclid(a,n,inv,ins);
if (inv<=0)
inv=n+inv%n;
g<<inv<<'\n';
f.close();
g.close();
return 0;
}