HDU 3555 Bomb

最新推荐文章于 2021-01-22 20:25:28 发布

置顶 sky_miange

最新推荐文章于 2021-01-22 20:25:28 发布

阅读量297

点赞数

分类专栏：数位dp 文章标签： ACM算法

本文链接：https://blog.csdn.net/sky_miange/article/details/50017143

版权

数位dp 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

Bomb

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 11579 Accepted Submission(s): 4127

Problem Description

The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number sequence includes the sub-sequence "49", the power of the blast would add one point.
Now the counter-terrorist knows the number N. They want to know the final points of the power. Can you help them?

Input

The first line of input consists of an integer T (1 <= T <= 10000), indicating the number of test cases. For each test case, there will be an integer N (1 <= N <= 2^63-1) as the description.

The input terminates by end of file marker.

Output

For each test case, output an integer indicating the final points of the power.

Sample Input

Sample Output

  
  
   
   0
1
15


   
   
    
    
     
     Hint
    
    From 1 to 500, the numbers that include the sub-sequence "49" are "49","149","249","349","449","490","491","492","493","494","495","496","497","498","499",
so the answer is 15.

Author

fatboy_cw@WHU

Source

2010 ACM-ICPC Multi-University Training Contest（12）——Host by WHU

Recommend

zhouzeyong | We have carefully selected several similar problems for you: 3554 3556 3557 3558 3559

很水的数位dp，求出不满足的条件，减掉就好了！

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cmath>
#include <iostream>
#include <queue>
#include <stack>
using namespace std;
typedef long long ll;
ll f[21][10];
ll dp[21];
void init()
{
    memset(f,0,sizeof(f));
    int i,j,k;
    f[0][0]=1;
    for(i=1; i<=20; i++)
    {
        for(j=0; j<10; j++)
        {
            for(k=0; k<10; k++)
            {
                if(j!=4 ||k!=9)
                    f[i][j]+=f[i-1][k];
            }
            //  cout<<f[i][j]<<" ";
        }
        // cout<<endl;
    }
}
ll solve(ll a)
{
    int i,j;
    int len=0;
    ll ans=0;
    while(a)
    {
        dp[++len]=a%10;
        a/=10;
    }
    dp[len+1]=0;
    for(i=len; i; i--)
    {
        for(j=0; j<dp[i]; j++)
        {
            if(dp[i+1]!=4 ||j!=9)
                ans+=f[i][j];
        }
        if( dp[i+1]==4 &&dp[i]==9)
            break;
    }
    return ans;
}
int main()
{
    int t;
    init();
    scanf("%d",&t);
    while(t--)
    {
        ll a;
        scanf("%lld",&a);
        ll res=solve(a+1);
        cout<<(a+1)-res<<endl;
    }
    return 0;
}