K - 难题

https://vjudge.net/contest/280124#problem/K

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int n,m,i,l,j,t,k,a[10],x,y,dp[20][20];
int f(int x)
{
    memset(a,0,sizeof(a));
    int k=0,i=0,ans=0;
    while (x)
    {
        k++;
        a[k]=x%10;
        x/=10;

    }
    for (i=k;i>=1; i--)
    {
        for (j=0; j<a[i]; j++)
                if (!(j==2&&a[i+1]==6)&&j!=4)
                    ans+=dp[i][j];
        if (a[i]==4||(a[i]==2&&a[i+1]==6)) break;
    }
    return ans;
}
int main()
{
    dp[0][0]=1;
    for (i=1; i<=10; i++)
        for (j=0; j<=9; j++)
            for (k=0; k<=9; k++)
                if (!(j==6&&k==2)&&j!=4)
                    dp[i][j]+=dp[i-1][k];
    while (scanf("%d%d",&n,&m))
    {
        if (n==0&&m==0) break;
        printf("%d\n",f(m+1)-f(n));
    }
}