Pagini recente » Cod sursa (job #1615385) | Cod sursa (job #486939) | Cod sursa (job #1236106) | Cod sursa (job #3148391) | Cod sursa (job #1468262)
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <deque>
#define nmax 200010
#define mod 1000000007
using namespace std;
int n,m;
int gcd(int a,int b)
{
int p=b-2; long long x=a,sol=1;
while (p>0) {
if (p%2==1) sol=sol*x%b;
x=x*x%b; p=p/2;
}
return sol;
}
int main() {
freopen("inversmodular.in","r",stdin);
freopen("inversmodular.out","w",stdout);
scanf("%d %d",&n,&m);
printf("%d\n",gcd(n,m));
return 0;
}