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

从[1,m][1,m]中依次选择77个数,满足前六个数中44和77的个数之和小于最后一个数的44和77的个数的方案数(mod1e9+7)\pmod{1e9+7}我们按照4和7的个数对[1,m]的数做等...
  • a1s4z5
  • a1s4z5
  • 2016年10月08日 08:40
  • 106

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

题目大意: 说七个party选择数字(各不相同) 而规定的小象的party选择的数字之中所拥有的数字4和7的个数要比其他六个party拥有的个数之和还要严格多,询问方案数。 如m=7时其余的随意选择至...
  • ahm001
  • ahm001
  • 2014年07月09日 08:43
  • 1014

codeforce 205C - Little Elephant and Interval

Description The Little Elephant very much loves sums on intervals. This time he has a pair of in...

B. Little Elephant and Numbers

time limit per test 2 seconds memory limit per test 256 megabytes input standard input ...

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

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

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 Round #136 (Div. 2) / 221B Little Elephant and Numbers (数论)

a

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 #136 (Div. 2) D. Little Elephant and Array

题意:给你n个数m个查询,问在每一个查询区间[l,r]范围内有多少个值为valu的数出现次数也为valu。 有两种用线段树的方法。两种方法同样都是离线处理查询,保存所有的查询,将查询按照终点从小到大...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces Round #157 (Div. 1)B. Little Elephant and Elections 数位dp好
举报原因:
原因补充:

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