题解 | 【模板】分数取模
【模板】分数取模
https://www.nowcoder.com/practice/23839ef20d5f4dbaa9664daa51864291
#include <iostream>
#define P 1000000007
using namespace std;
int kpow(long long a, long long b, long long p) {
if (p == 1) return 0;
long long res = 1;
a %= p;
while (b) {
if (b % 2) res = (res * a) % p;
a = (a * a) % p;
b >>= 1;
}
return res;
}
int main() {
long long a, b, t;
cin >> t;
while (t--) {
cin >> a >> b;
cout<<((a%P+P)%P * kpow(b, P-2, P))%P<<endl;
}
return 0;
}
