zoj Modular Inverse

The modular modular multiplicative inverse of an integer a modulo m is an integer x such that a-1≡x (mod m). This is equivalent to ax≡1 (mod m).

Input

There are multiple test cases. The first line of input is an integer T ≈ 2000 indicating the number of test cases.

Each test case contains two integers 0 < a ≤ 1000 and 0 < m ≤ 1000.

Output

For each test case, output the smallest positive x. If such x doesn't exist, output "Not Exist".

Sample Input

3
3 11
4 12
5 13

Sample Output

4
Not Exist

思路：逆元裸题，题意中 c=1

#include<cstdio>
#include<cstring>
typedef long long LL;

LL exgcd(LL a,LL b,LL &x,LL &y){
	if(!b){
		x=1;
		y=0;
		return a;
	}
	LL ans=exgcd(b,a%b,x,y);
	LL t=x;
	x=y;
	y=t-a/b*y;
	return ans; 
} 

LL cal(LL a,LL b,LL c){
	LL x,y;
	LL gcd=exgcd(a,b,x,y);
	if(c%gcd!=0) return -1;
	x*=c/gcd;
	b/=gcd;
	if(b<0) b=-b;
	LL ans=x%b;
	if(ans<=0) ans+=b;
	return ans;
}
int main(){
	LL t,a,m;
	scanf("%lld",&t);
	while(t--){
		scanf("%lld%lld",&a,&m);
		LL ans=cal(a,m,1);
		if(ans==-1) printf("Not Exist\n");
		else printf("%lld\n",ans);
	}
	return 0;
}