hdu2089 不要62 两解

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int maxn=1e6+5;
int n,m;
int c[10][10];
int tot,e[10];
template<class t>void red(t &x)
{
    int w=1;
    x=0;
    char ch=getchar();
    while(ch>'9'||ch<'0')
    {
        if(ch=='-')
            w=-1;
        ch=getchar();
    }
    while(ch>='0'&&ch<='9')
    {
        x=(x<<3)+(x<<1)+ch-'0';
        ch=getchar();
    }
    x*=w;
}
void input()
{
    freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
}
void dv(int x)
{
    tot=0;
    while(x)
    {
        e[++tot]=x%10;
        x/=10;
    }
    e[tot+1]=0;
}
int solve(int x)
{
    dv(x);
    int ans=0;
    for(int i=tot;i>=1;--i)
    {
        for(int j=0;j<e[i];++j)
            if(e[i+1]!=6||j!=2)
                ans+=c[i][j];
        if(e[i]==4||(e[i+1]==6&&e[i]==2))
            break; 
    }
    return ans;
}
int main()
{
    input();
    c[0][0]=1;
    for(int i=1;i<=7;++i)
        for(int j=0;j<=9;++j)
            for(int k=0;k<=9;++k)
                if(j!=4&&!(j==6&&k==2))
                    c[i][j]+=c[i-1][k]; 
    while(scanf("%d%d",&n,&m)==2)
    {
        if(!n&&!m)
            break;
        //memset(c,0,sizeof(c));
        printf("%d
",solve(m+1)-solve(n));
    }
    return 0;
}

#include<bits/stdc++.h>
using namespace std;
const int maxn=1e5+5;
int tot,e[20];
long long c[20][20][2];
int n,m;
template<class t>void red(t &x)
{
    int w=1;
    x=0;
    char ch=getchar();
    while(ch>'9'||ch<'0')
    {
        if(ch=='-')
            w=-1;
        ch=getchar(); 
    }
    while(ch>='0'&&ch<='9')
    {
        x=(x<<3)+(x<<1)+ch-'0';
        ch=getchar();
    } 
    x*=w;
} 
void input()
{
    freopen("input.txt","r",stdin);
}
void dv(int x)
{
    tot=0;
    while(x)
    {
        e[++tot]=x%10;
        x/=10;
    }
    e[tot+1]=0;
}
long long dfs(int pos,bool limit,bool zero,bool dc,int pre)
{
    if(pos==0)
        return dc;
    if(!limit&&zero&&~c[pos][pre][dc])
        return c[pos][pre][dc];
    int up=limit?e[pos]:9;
    int ans=0;
    for(int i=0;i<=up;++i)
        ans+=dfs(pos-1,limit&&(i==up),zero||i,dc||i==4||(pre==6&&i==2),i);
    if(!limit&&zero)
        c[pos][pre][dc]=ans;
    return ans; 
}
long long solve(int x)
{
    dv(x);
    memset(c,-1,sizeof(c));
    return dfs(tot,1,0,0,0);
}
int main()
{
    //input();
    while(scanf("%d%d",&n,&m)==2&&n&&m)
        printf("%lld
",m-n+1-solve(m)+solve(n-1));
    return 0;
}