链接:https://ac.nowcoder.com/acm/contest/4381/B
来源:牛客网
题意:
给你一个组合数和一个数,判断它们是否相等
解题思路:
利用Lucas或者逆元求得组合数的值,然后与p值进行比较
这是Lucas
#include<bits/stdc++.h>
#define ll long long
using namespace std;
ll mod=10007;
ll n,m;
ll pow(ll x,ll n)
{
ll res = 1;
x%=mod;
while (n)
{
if(n&1) res = res*x%mod;
x = x*x %mod;
n >>=1;
}
return res;
}
ll C(ll n,ll m)
{
if(n < m) return 0;
// c(n,m) = n!/m!/(n-m)!
ll res = 1;
for(int i=1; i<=m; i++)
{
ll a = (n+i-m)%mod;
ll b = i%mod;
res = res*(a*pow(b,mod-2)%mod)%mod;
}
return res;
}
ll Lucas(ll n,ll m)
{
if(m == 0) return 1;
return C(n%mod, m%mod) * Lucas(n/mod,m/mod)%mod;
}
int main()
{
string s;
cin>>n>>m>>s;
int ans=0;
for(int i=0; i<s.length(); i++)
{
ans=ans*10+(s[i]-'0');
ans%=mod;
}
if(ans==Lucas(n,m))
cout<<"Yes!";
else cout<<"No!";
}
这是逆元
#include <bits/stdc++.h>
using namespace std;
const int N=4e5+100;
typedef unsigned long long ll;
const int maxn=4e5+100;
ll n,m;string p;
ll P[maxn];
bool slove(ll mod)
{
ll l=1,r=0;
ll pow=0;
P[0]=1;
for(int i=1;i<p.size();i++) P[i]=P[i-1]*10%mod;
for(int i=p.size()-1;i>=0;i--)
{
r=(r+P[pow]*(p[i]-'0')%mod)%mod;
pow++;
}
if(m>n) return r==0;
for(ll i=n-m+1;i<=n;i++)
{
l=(l*i%mod);
}
for(ll i=1;i<=m;i++) r=r*i%mod;
return l==r;
}
int main()
{
cin>>n>>m>>p;
ll mod1=1e9+7,mod2=1e9+3;
if(slove(mod1)&&slove(mod2)) cout<<"Yes!"<<endl;
else cout<<"No!"<<endl;
return 0;
}