牛牛和牛可乐的赌约
分数取模公式:
比如E/V 对MOD 取余就是: E*ksm(V,MOD-2)%MOD;
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007
ll qpow(ll a , ll n )
{
ll base = a , ans = 1;
while(n){
if(n&1)
ans = (ans * base) % mod ;
base *= base ;
base %= mod;
n>>=1;
}
return ans;
}
int main()
{
int a ;
cin>>a;
while(a--){
ll n,m;
cin>>n>>m;
cout<<(qpow(n,m)-1) * qpow(qpow(n,m),mod-2) % mod <<endl;
}
return 0;
}
这道题用逆元其实也行,复习一下!
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=1e9+7;
ll qpow(ll a,ll b){
ll ans = 1;
a=a%mod;
while(b>0){
if(b&1) ans=ans*a%mod;
b>>=1;
a=a*a%mod;
}
return ans;
}
ll inv(ll a){
return qpow(a,mod-(ll)2);
}
int main() {
int t;
scanf("%d",&t);
while(t--){
ll n, m;
scanf("%lld%lld",&n,&m);
ll a = qpow(n, m);
ll b = inv(a);
printf("%lld\n", ((ll)(a - 1) * b) % (ll)mod);
}
}