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

## 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)$1000000007 (10^9 + 7)$.
Input

A single line contains a single positive integer m(7m109)$(7 ≤ m ≤ 10^9)$— 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)$1000000007 (10^9 + 7)$.
Sample test(s)
Input

7

Output

0

Input

8

Output

1440

#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 & 259 D]Little Elephant and Elections 数位dp+dfs

• ahm001
• 2014年07月09日 08:43
• 1038

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

• zp___waj
• 2016年05月14日 10:42
• 308

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

B. Little Elephant and Elections time limit per test 2 seconds memory limit per test 256...
• u013912596
• 2014年08月23日 16:00
• 842

## Codeforces Round #136 (Div. 2) / 221A Little Elephant and Function (数学)

A. Little Elephant and Function http://codeforces.com/problemset/problem/221/A time limit pe...
• synapse7
• 2013年08月18日 23:50
• 1026

## Codeforces Round #157 (Div. 1)　B. Little Elephant and Elections

B. Little Elephant and Elections time limit per test 2 seconds memory limit per test 256...
• u010422038
• 2013年10月11日 17:55
• 949

## Codeforces Round #315 (Div. 1)

Codeforces Round #315 (Div. 1)
• u013023344
• 2015年08月16日 21:31
• 1063

## Codeforces Round #378 (Div. 2) E. Sleep in Class

• Fsss_7
• 2016年11月15日 13:48
• 355

## Codeforces Round #258 (Div. 2)-(A,B,C,D,E)

A:Game With Sticks 水题。。。每次操作，都会拿走一个横行，一个竖行。 所以一共会操作min（横行，竖行）次。 #include #include #include #include ...
• rowanhaoa
• 2014年07月25日 14:39
• 1468

## Codeforces Round #259 (Div. 2) C. Little Pony and Expected Maximum

C. Little Pony and Expected Maximum time limit per test 1 second memory limit per test 2...
• squee_spoon
• 2014年08月02日 02:52
• 627

## Codeforces Round #259 (Div. 2) C. Little Pony and Expected Maximum （找规律）

• u012377575
• 2014年08月02日 11:49
• 509

举报原因： 您举报文章：Codeforces Round #157 (Div. 1)B. Little Elephant and Elections 数位dp好 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)