Pagini recente » Cod sursa (job #2044638) | Cod sursa (job #2285586) | Cod sursa (job #1379485) | Cod sursa (job #2952726) | Cod sursa (job #3162566)
#include <fstream>
using namespace std;
ifstream cin("inversmodular.in");
ofstream cout("inversmodular.out");
int M;
int mod(int a, int b)
{
long long p=1;
while(b)
{
if(b%2==1)
p=(1LL*((p%M)*(a%M)))%M;
a=(1LL*(a%M)*(a%M))%M;
b/=2;
}
return p;
}
void euclid(int a, int b, int &d, int &x, int &y) {
if (b == 0) {
d = a;
x = 1;
y = 0;
} else {
int x0, y0;
euclid(b, a % b, d, x0, y0);
x = y0;
y = x0 - (a / b) * y0;
}
}
int main()
{
int n;
int rasp,x1,x2;
cin>>n>>M;
euclid(n,M,x1,rasp,x2);
if (rasp<0)
rasp+=M;
cout<<rasp;
//cout<<mod(n,rasp);
return 0;
}