51nod 1298 乘法逆元
扩展欧几里得求逆元,模板题啦!
学习请往:http://blog.csdn.net/qq_33199236/article/details/51429013
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <cmath>
#include <queue>
using namespace std;
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
#define MOD 1000
#define N 510
int exgcd(int a,int b,int& x,int& y)
{
if(b == 0)
{
x = 1;
y = 0;
return a;
}
int d = exgcd(b, a%b ,x ,y);
int temp = x;
x = y;
y = temp - a/b*y;
return d;
}
int main()
{
int n,m;
scanf("%d%d",&n,&m);
int x,y;
exgcd(n,m,x,y);
while(x < 0)
x += m;
int ans = x%m;
printf("%d\n",ans);
return 0;
}