HDU3555-Bomb

Bomb

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

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.
   
   
   
    
  
  

 

Author

fatboy_cw@WHU

 

Source

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

 

Recommend

zhouzeyong

 

题意：问0到n之间有多少个数是有49的

解题思路：数位dp

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int a[30];
LL dp[30][20][2];

LL dfs(int pos, int pre, int sta, bool limit)
{
	if (pos == -1) return sta;
	if (!limit&& dp[pos][pre][sta] != -1) return dp[pos][pre][sta];
	int up = limit ? a[pos] : 9;
	LL ret = 0;
	for (int i = 0; i <= up; i++)
		ret += dfs(pos - 1, i, sta || (pre == 4 && i == 9), limit&&i == up);
	if (!limit) dp[pos][pre][sta] = ret;
	return ret;
}

LL solve(LL x)
{
	int pos = 0;
	while (x)
	{
		a[pos++] = x % 10;
		x /= 10;
	}
	return dfs(pos - 1, -1, 0, true);
}

int main()
{
	int t;
	scanf("%d",&t);
	while (t--)
	{
		memset(dp, -1, sizeof(dp));
		LL x;
		scanf("%lld", &x);
		printf("%lld\n",solve(x));
	}
	return 0;
}

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>

using namespace std;

#define LL long long
const int INF = 0x3f3f3f3f;

int a[30];
LL dp[30][2];

LL dfs(int pos, int pre, int sta, bool limit)
{
	if (pos == -1) return 1;
	if (!limit&& dp[pos][sta] != -1) return dp[pos][sta];
	int up = limit ? a[pos] : 9;
	LL ret = 0;
	for (int i = 0; i <= up; i++)
	{
		if (pre == 4 && i == 9) continue;
		ret += dfs(pos - 1, i, i==4, limit&&i == up);
	}
	if (!limit) dp[pos][sta] = ret;
	return ret;
}

LL solve(LL x)
{
	int pos = 0;
	while (x)
	{
		a[pos++] = x % 10;
		x /= 10;
	}
	return dfs(pos - 1, -1, 0, true);
}

int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		memset(dp, -1, sizeof(dp));
		LL x;
		scanf("%lld", &x);
		printf("%lld\n", x+1-solve(x));
	}
	return 0;
}