Description
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 toax≡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,使a乘以x对m的取余等于1对m的取余!
#include<iostream>
using namespace std;
int main()
{
int t,a,m;
cin>>t;
while(t--)
{
int flag=0;
cin>>a>>m;
if(m==1)
{
cout <<"1"<< endl;
continue;
}
else
{
for(int i=0;i<=m;i++)
if(a*i%m==1)
{
cout<<i<<endl;
flag=1;
break;
}
}
if(flag==0)
cout<<"Not Exist"<<endl;
}
return 0;
}