Codeforces Round #157 (Div. 1)B. Little Elephant and Elections 数位dp好

原创 2015年07月07日 20:52:35

B. Little Elephant and Elections

There have recently been elections in the zoo. Overall there were 7 main political parties: one of them is the Little Elephant Political Party, 6 other parties have less catchy names.

Political parties find their number in the ballot highly important. Overall there are m possible numbers: 1, 2, …, m. Each of these 7 parties is going to be assigned in some way to exactly one number, at that, two distinct parties cannot receive the same number.

The Little Elephant Political Party members believe in the lucky digits 4 and 7. They want to evaluate their chances in the elections. For that, they need to find out, how many correct assignments are there, such that the number of lucky digits in the Little Elephant Political Party ballot number is strictly larger than the total number of lucky digits in the ballot numbers of 6 other parties.

Help the Little Elephant Political Party, calculate this number. As the answer can be rather large, print the remainder from dividing it by 1000000007(109+7).
Input

A single line contains a single positive integer m(7m109)— the number of possible numbers in the ballot.
Output

In a single line print a single integer — the answer to the problem modulo 1000000007(109+7).
Sample test(s)
Input

7

Output

0

Input

8

Output

1440

思路:首先 数位dp计算出包含n个7或4的数个有多少个,然后dfs一边找出来就行了。dp[cur][S][K]表示处理到当前为止,有S个7或者4,一共有K个7或者4的有多少个

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=20;
const int MOD=1e9+7;
int M;
int dig[maxn];
LL dp[maxn][maxn][maxn];
LL sum[maxn];
int len;
LL dfs(int cur,int e,int S,int K)
{
    if(cur<0)return S==K;
    if(!e&&dp[cur][S][K]!=-1)
        return dp[cur][S][K];
    int end=(e?dig[cur]:9);
    LL ans=0;
    for(int i=0;i<=end;i++)
    {
        ans+=dfs(cur-1,e&&i==end,S+(i==4||i==7),K);
        ans%=MOD;
    }
    if(!e)dp[cur][S][K]=ans;
    return ans;
}
void solve(int x)
{
    len=0;
    memset(dp,-1,sizeof(dp));
    while(x)
    {
        dig[len++]=x%10;
        x/=10;
    }
    for(int i=0;i<=len;i++)
        sum[i]=dfs(len-1,1,0,i);
    sum[0]--;//把0也算进去了
}
LL solve(int num,int pos)
{
    if(pos<=0)return 1;
    LL ans=0;
    for(int i=0;i<=num;i++)
    {
        if(sum[i]<=0)continue;
        sum[i]--;
        ans=(ans+(1+sum[i])*solve(num-i,pos-1))%MOD;
        sum[i]++;
    }
    return ans;
}
int main()
{
    scanf("%d",&M);
    solve(M);
    LL ans=0;
    for(int i=1;i<=len;i++)
        ans=(ans+sum[i]*solve(i-1,6))%MOD;
    cout<<ans<<endl;
    return 0;
}
版权声明:本文为博主原创文章,未经博主允许不得转载。 举报

相关文章推荐

Codeforces 258B. Little Elephant and Elections【数位DP,DFS】

B. Little Elephant and Elections time limit per test 2 seconds memory limit per test 256...

CodeForces 258B Little Elephant and Elections 数位DP

题意:有7个人要从m个数里面任选一个,且不能重复,一个数里面幸运数的个数就是4的个数加7的个数,求第一个人的这个数的幸运数的个数比其他六个人的幸运数之和还要大的方案数。 思路:先用数位DP求出幸运数...

精选:深入理解 Docker 内部原理及网络配置

网络绝对是任何系统的核心,对于容器而言也是如此。Docker 作为目前最火的轻量级容器技术,有很多令人称道的功能,如 Docker 的镜像管理。然而,Docker的网络一直以来都比较薄弱,所以我们有必要深入了解Docker的网络知识,以满足更高的网络需求。

Codeforces Round #129 (Div. 1) B. Little Elephant and Cards

B. Little Elephant and Cards time limit per test 2 seconds memory limit per test 256 meg...

Codeforces Round #136 (Div. 1) B. Little Elephant and Array

time limit per test 4 seconds memory limit per test 256 megabytes input standard input output ...

Codeforces Round #129 (Div. 2) B. Little Elephant and Sorting

B. Little Elephant and Sorting time limit per test 1 second memory limit per test 256 me...

Codeforces 258B Little Elephant and Elections

题目链接:CF258B 还是继续我的数位DP专题学习 题意:在【1,M】中选择7个数,定义数字中含有4或者7的叫做运气数,如4447有4个,可以累计 现在要求:选择第一个数的运气值要...

Codeforces-258B Little Elephant and Elections

B. Little Elephant and Elections time limit per test 2 seconds memory limit per test 256 meg...

Codeforces Round #129 (Div. 1) A Little Elephant and Interval

A. Little Elephant and Interval time limit per test 2 seconds memory limit per test 256 ...

Codeforces Round #129 (Div. 1)E. Little Elephant and Strings

题意:给出n个字符串,问每个字符串有多少个子串至少出现在z

[Codeforces 258B & 259 D]Little Elephant and Elections 数位dp+dfs

题目大意: 说七个party选择数字(各不相同) 而规定的小象的party选择的数字之中所拥有的数字4和7的个数要比其他六个party拥有的个数之和还要严格多,询问方案数。 如m=7时其余的随意选择至...
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)