Bomb

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

<span style="font-size:14px;"># include <cstdio>
# include <cstring>
# include <iostream>
using namespace std;

__int64 dp[21][3],n;
int len,bit[21];
//dp[i][0]表示i位数有多少个有49的
//dp[i][1]表示i位数有多少个有9的
//dp[i][2]表示i位数有多少个没有49的

void Init()
{
    memset(dp,0,sizeof(dp));
    dp[0][2]=1;
    for(int i=1;i<20;i++)
    {
        dp[i][0]=(__int64)dp[i-1][0]*10+dp[i-1][1];
        dp[i][1]=dp[i-1][2];
        dp[i][2]=(__int64)dp[i-1][2]*10-dp[i-1][1];
    }
}

int main()
{
    //freopen("a.txt","r",stdin);
    Init();
    int t,i;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%I64d",&n);
        n++;
        len=0;
        while(n)
        {
            bit[++len]=n%10;
            n/=10;
        }
        bit[len+1]=0;
        __int64 ans=0;int flag=0;
        for(i=len; i ;i--)
        {
            ans+=(__int64)bit[i]*dp[i-1][0];
            if(flag)    ans+=(__int64)dp[i-1][2]*bit[i];
            if(!flag&&bit[i]>4)    ans+=dp[i-1][1];
            if(bit[i]==9&&bit[i+1]==4)    flag=1;
        }
        printf("%I64d\n",ans);
    }
    return 0;
}</span>