乘法逆元（扩展欧几里得）

下面是乘法逆元的一个算法 

#define low16(x) ((x) & 0xFFFF) 

static unsigned short MulInv(unsigned short x)
{
	unsigned short t0, t1;
	unsigned short q, y;

	if (x <= 1)
		return x;
	t1 = (unsigned short)(0x10001L / x);		/* Since x >= 2, this fits into 16 bits */
	y = 0x10001L % x;
	if (y == 1)                   //如果余数为1 则找到逆元 
		return low16(1 - t1);

	t0 = 1;
	do
	{
		q = x / y;     
		x = x % y;
		t0 += q * t1;
		if (x == 1)
			return t0;
		q = y / x;
		y = y % x;
		t1 += q * t0;     //   t1=q*t0+ t1
	} while (y != 1);

	return low16(1 - t1);
}