题目描述:
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?
输入:
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.
输出:
For each test case, output an integer indicating the final points of the power.
样例输入:
3
1
50
500
样例输出:
0
1
15
数位dp,堪称一道模板题,过程可能有点迷,要好好想想
上代码:
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
using namespace std;
long long dp[20][15];
void init()
{
memset(dp,0,sizeof(dp));
dp[0][0]=1;
for(int i=1;i<=20;i++)
{
for(int j=0;j<=9;j++)
{
for(int k=0;k<=9;k++)
{
if(!(j==4&&k==9))
dp[i][j]+=dp[i-1][k];
}
}
}
}
long long solve(long long n)
{
long long ans=0;
long long len=0;
int digit[20];
memset(digit,0,sizeof(digit));
while(n)
{
digit[++len]=n%10;
n/=10;
}
for(int i=len;i>=1;i--)
{
for(int j=0;j<digit[i];j++)
{
if(!(digit[i+1]==4&&j==9))
ans+=dp[i][j];
}
if(digit[i+1]==4&&digit[i]==9)
{
break;
}
}
return ans;
}
int main()
{
init();
int ttt;
scanf("%d",&ttt);
while(ttt--)
{
long long n;
scanf("%lld",&n);
printf("%lld\n",n+1-solve(n+1));
}
return 0;
}