Pagini recente » Cod sursa (job #2314759) | Cod sursa (job #1453508) | Cod sursa (job #889467) | Cod sursa (job #304613) | Cod sursa (job #2050429)
#include <fstream>
using namespace std;
ifstream f("inversmodular.in");
ofstream g("inversmodular.out");
long long n,a,inv,p;
/*long long putere(long long x,long long n)
{
long long p;
if(n==0) return 1;
if(n==1) return x;
p=putere(x,n/2);
if(n%2==0) return (p*p)%n;
else return (x*p*p)%n;
}*/
void gcd(long long &x,long long &y,long long a,long long b)
{
if(b==0) {x=1;y=0;}
else
{gcd(x,y,b,a%b);
long long aux=x;
x=y;
y=aux-y*(a/b);
}
}
int main()
{
f>>a>>n;
gcd(inv,p,a,n);
if(inv<=0) inv=n+inv%n;
g<<inv<<" ";
return 0;
}