东华大学2020年程序设计竞赛（同步赛）B

东华大学2020年程序设计竞赛（同步赛）B
Given a positive integer y and a prime p, you are asked to find an integer x such that (x \times y)\ mod\ p= 1(x×y) mod p=1. If such x exists, output any x mod p. Otherwise, output -1.

Hint: For any integer a and positive integer b, a mod b is the remainder of a dividing b. Remind that a mod b is non-negative!

输入描述:
The first line of input contains a positive integer T, which is the number of test cases. (1 \le T \le 200,000)(1≤T≤200,000)
For each test case, there will be one line containing 2 positive integers y, p. ( 1 \le y, p \le 10^9 )(1≤y,p≤10
9
), p is guaranteed to be a prime)
输出描述:
Output one integer for each test case. If such x exists, output any x mod p. Otherwise, output -1.
示例1
输入
复制
3
1 97
2 97
3 97
输出
复制
1
49
65
链接：https://ac.nowcoder.com/acm/contest/5891/B
费马小定理 a^(p-1) (mod p)=1 p为素数

#include<iostream>
#include<algorithm>
#include<cstdio>
using namespace std;
typedef long long ll;
ll f(ll a,ll b,ll  p)
{
    ll s=1;
    while(b)
    {
        if(b%2==1)s=s*a%p;
        a=a*a%p;
        b=b/2;
    }
    return s;
}
int main()
{int t;
    cin>>t;
    while(t--)
    {
        int y,p;
        cin>>y>>p;
        if(y%p==0)printf("-1\n");
        else
        {
            ll c=f(y,p-2,p);
            cout<<c<<endl;
        }
    }
    return 0;
}