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 8
总结:
称之为 x 是关于 m 的乘法逆元,等价于 ax + my = 1 当1 对 gcd(a,m)取余不等于零时,则无解
/*
a*x
*/
#include<iostream>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<vector>
#include<math.h>
#include<string.h>
#include<stdio.h>
#define LL long long
using namespace std;
//扩展欧几里得模板
LL e_gcd(LL a,LL b,LL &x,LL &y)
{
if(b==0)
{
x=1;
y=0;
return a;
}
LL ans=e_gcd(b,a%b,x,y);
LL temp=x;
x=y;
y=temp-a/b*y;
return ans;
}
//扩展欧几里得模板
LL Cal(LL a,LL b,LL c)
{
LL x,y;
LL gcd=e_gcd(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(void)
{
int ncase;
cin >> ncase;
while(ncase--)
{
LL a,m,ans;
scanf("%lld %lld",&a,&m);
ans = Cal(a,m,1);//等价于 ax + by = 1
if(ans==-1) printf("Not Exist\n");//如果1 对 gcd(a,b)取余不等于零,则无解
else printf("%lld\n",ans);
}
return 0;
}