Faulty Odometer--2012天津网络赛--数位dp

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
using namespace std;
__int64 dp[15][2];
__int64 num[15],n[]={0,1,10,100,1000,10000,100000,1000000,10000000,100000000};
char str[15];
__int64 dfs(__int64 pos,__int64 stu,bool flag)
{
    if(pos==0) return 0;
    if(flag&&dp[pos][stu]!=-1) return dp[pos][stu];
    __int64 t=flag?9:num[pos];
    __int64 ans=0;
    for(__int64 i=0;i<=t;i++)
    {
        if(stu==1) continue;
        if(i==3||i==8) ans+=(n[pos]);
        else ans+=dfs(pos-1,0,flag||i<t);
    }
    if(flag) dp[pos][stu]=ans;
    return ans;
}
__int64 solve()
{
    __int64 len=strlen(str),j=len;
    __int64 t=0;
    while(t<len)
    {
        num[j]=str[t]-'0';
        j--;
        t++;
    }
    return (dfs(len,0,0));
}
int main()
{
    __int64 i,j,nnum;
    memset(dp,-1,sizeof(dp));
    while(scanf("%s",str)!=EOF)
    {
        if(str[0]=='0') break;
        nnum=atoi(str);
        //printf("%I64d %I64d\n",nnum,solve());
        printf("%s: %I64d\n",str,nnum-solve());
    }
    return 0;
}