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

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

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

题意:   规定一个数的幸运度为这位数含有多少4和7 现在在值为1~m的m个数中任意选7个问第7个数的幸运度比前6个数幸运度总和还要多的情况有多少种 m 分析: 因为幸运度最大为9所以可以先...
  • zp___waj
  • 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
  • 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
  • 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
  • u010422038
  • 2013年10月11日 17:55
  • 949

Codeforces Round #315 (Div. 1)

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

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

链接:http://codeforces.com/contest/733/problem/E 题意:给一个只含'U'和'D'的字符串,U表示向右走,D表示向左走。每个格子踩一次之后翻转(U变D,D变...
  • Fsss_7
  • 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
  • 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
  • squee_spoon
  • 2014年08月02日 02:52
  • 627

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

题目链接:Codeforces Round #259 (Div. 2)  C. Little Pony and Expected Maximum 求
  • u012377575
  • u012377575
  • 2014年08月02日 11:49
  • 509
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Codeforces Round #157 (Div. 1)B. Little Elephant and Elections 数位dp好
举报原因:
原因补充:

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