Bomb
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 24389 Accepted Submission(s): 9202
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
3 1 50 500
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.
题意:1到n含数字49的数字的个数
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<map>
#include<set>
#include<cmath>
#include<cctype>
#include<ctime>
#define INF 0x3f3f3f3f
#define PI acos(-1.0)
#define MOD 998244353
typedef long long ll;
typedef unsigned long long ull;
const int mm=100000;
using namespace std;
int a[25];
ll dp[25][3];
ll dfs(int len,int cnt,bool limit)
{
if(len==-1) return cnt==2;
if(!limit&&dp[len][cnt]!=-1) return dp[len][cnt];
int up=limit?a[len]:9;
ll ans=0;
for(int i=0;i<=up;i++)
{
int flag=cnt;
if(cnt==1&&i==9) flag=2;
else if(cnt==0&&i==4) flag=1;
else if(cnt==1&&i!=4) flag=0;
ans+=dfs(len-1,flag,i==a[len]&&limit);
}
if(!limit) dp[len][cnt]=ans;
return ans;
}
ll fun(ll x)
{
int len=0;
while(x)
{
a[len++]=x%10;
x/=10;
}
return dfs(len-1,0,1);
}
int main()
{
ll m,t;
cin>>t;
while(t--)
{
cin>>m;
memset(dp,-1,sizeof(dp));
cout<<fun(m)<<endl;
}
return 0;
}