本题特点 幸运数的个数非常少,打暴力算一算在题目范围中是1022个;
用dp递推,dp[i][j]表示用前i个幸运数排成长度j的序列所得方案数;
dp[i][j]=dp[i-1][j](前i-1个数组成j的方案数,也就是不用第i个)+b[i]*dp[i-1][j-1];
b[i]表示第i个幸运数在序列中出现的次数;
一共有k个数,其中i个数用非幸运数,k-i个用幸运数,用排列组合求得用非幸运数的方案再乘以幸运数的方案取模;
界定一下i枚举的范围,也就是保证每个量不等于零;
#include<iostream>
#include<cstdio>
using namespace std;
typedef long long ll;
const ll p=1e9+7;
inline ll read()
{
ll res=0,f=1;
char ch=getchar();
while(ch<'0'||ch>'9')
{
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9')
{
res=res*10+ch-'0';
ch=getchar();
}
return res*f;
}
inline ll kuaisumi(ll x,int y)
{
ll sum=1;
while(y){
if(y&1) sum=sum*x%p;
x=x*x%p;
y/=2;
}
return sum;
}
int f[100100];
inline ll C(ll n,ll k)
{
if(k>n) return 0;
ll n1=f[n],k1=f[k],m1=f[n-k];
ll x1=kuaisumi(m1,p-2)%p;
ll x2=kuaisumi(k1,p-2)%p;
ll x=n1%p*x1%p*x2%p;
return x;
}
inline int judge(ll x)
{
int num=0,wei=1;
while(x)
{
int y=x%10;
if(y!=4&&y!=7) return 0;
if(y==4) num+=1*wei;
if(y==7) num+=2*wei;
wei*=2;
x/=10;
}
return num;
}
int n,k,cnt,ans,m,num;
int dp[1050][1050];
int a[1050];
int b[1050];
int c[1050];
int vis[1050];
int main()
{
freopen("lucky.in","r",stdin);
freopen("lucky.out","w",stdout);
n=read();k=read();
for(register int i=1;i<=n;i++)
{
ll x=read();
int y=judge(x);
if(y!=0)
{
cnt++;
if(!vis[y])
{
num++;
a[num]=y;
vis[y]=num;
b[num]=1;
}
else
b[vis[y]]++;
}
}
dp[0][0]=1;
for (int i=0;i<num;++i)
{
for (int j =0; j<= i; ++j) {
dp[i+1][j] = (dp[i+1][j] + dp[i][j]%p) %p;
dp[i+1][j+1] = (dp[i+1][j+1]%p +(dp[i][j]%p * b[i+1] % p)) %p;
}
}
f[0]=1;
for(int i=1;i<=n;i++)
f[i]=f[i-1]%p*i%p;
m=n-cnt;
int st=max(0,k-cnt);
int ed=min(k,m);
for(int i=st;i<=ed;i++)
{
if(k-i<0) break;
ans=(ans+dp[num][k-i]%p*C(m,i)%p)%p;
}
cout<<ans;
return 0;
}