【HDU35350】【Bomb】

Bomb

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

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

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;

int T;
__int64 n;
char s[65];
__int64 dp[70][10];
__int64 f(int len,int n)
{
	//if(n == 0 && len == 1) return 0;
	if(len == 1) return dp[1][n] = 1;
	if(dp[len][n] > 0) return dp[len][n];
	dp[len][n] = 0;
	for(int i=0;i<=9;i++)
	{
		if(!(n==4 && i ==9))
			dp[len][n] += f(len-1,i);
	}
	return dp[len][n];
}
__int64 solve(__int64 x)
{
	__int64 ret = 0;
	sprintf(s,"%I64d",x);
	int len = strlen(s);
	int curlen = len;
	for(int i=0;i<len;i++)
	{
		int d = s[i] - '0';
		int j;
		for(int j=0;j<d;j++)
		{
			if(i >= 1 && (s[i-1] == '4') && j == 9) continue;
			ret += f(curlen,j);
		}
		curlen --;
		if(i >= 1 && s[i-1] == '4' && s[i] == '9') break;
	}
	return ret;
}
int main()
{
	scanf("%d",&T);
	while(T--)
	{
		scanf("%I64d",&n);
		memset(dp,-1,sizeof(dp));
		cout << n - (solve(n+1) -1 )<< endl;	
	}
	return 0;
}