乘法逆元(扩展欧几里得)

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
//如果 a % b == 0, c 是 b 模 m ( 质数 ) 下的逆, ( a / b ) % m = ( a * c ) % m.
int exgcd( int a, int b, int & y ) {
	if( b == 0 ) {
		y = 0;
		return 1;
	}
	int tem = exgcd( b, a % b, y );
	int ret = y;
	y = tem - ( a / b ) * ret;
	return ret;
}
int gcd( int a, int b ) {
	if( b == 0 )
		return a;
	return gcd( b, a % b );
}
int ni( int a, int mod ) {
	int y;
	if( gcd( a, mod ) != 1 )
		return -1;
	int x = exgcd( a, mod, y );
	x = x - x / mod * mod;
	if( x < 0 )
		x += mod;
	return x;
}
int main() {
	int n,mod;
	while( scanf( "%d", &n ) && n ) {
		scanf( "%d", &mod );
		printf( "%d\n", ni( n, mod ) );
	}
	return 0;
}