题目链接:
HDU 1576 A/B
题意:
已知A%9973 = n,gcd(B, 9973)=1,给出n和B求A/B%9973.
分析:
裸的乘法逆元。利用费马小定理:因为gcd(B, 9973) = 1,且9973为质数,所以A/B%9973 = A%9973 * B^(9973 - 2) % 9973.
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <cmath>
#include <ctime>
#include <cassert>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
typedef long long ll;
const int mod = 9973;
int T;
ll n, B;
ll quick_pow(ll a, ll b)
{
ll res = 1, tmp = a % mod;
while(b){
if(b & 1) res = res * tmp % mod;
tmp = tmp * tmp % mod;
b >>= 1;
}
return res;
}
int main()
{
scanf("%d", &T);
while(T--){
scanf("%lld%lld", &n, &B);
ll ans = quick_pow(B, mod - 2);
printf("%lld\n", ans * n % mod);
}
return 0;
}