【HDU2089】不要62 数位DP

Problem

http://acm.hdu.edu.cn/showproblem.php?pid=2089
https://vjudge.net/problem/HDU-2089

Solution

f[i][0|1][0|1]表示到i位，第i位是否是6，是否“紧贴”，
水题。

CODE

/*
 * @key words: digit DP
 * @tested on: HDU 2089 
 * @Author: LuHaoqi 
 * @Date: 2017-08-11 17:17:16 
 * @Last Modified by: LuHaoqi
 * @Last Modified time: 2017-08-11 17:17:39
 */
#include<bits/stdc++.h>
using namespace std;
#define ll long long
int f[10][2][2],tmp[10],a[10],n,m;

int solve(int n)
{
    if (n==0) return 0;
    int len=0,ans=0;
    while (n) tmp[++len]=n%10,n/=10;
    for (int i=1;i<=len;i++) a[i]=tmp[len-i+1];
    memset(f,0,sizeof(f));
    f[0][0][1]=1;
    for (int i=0;i<=len;i++)
        for (int j=0;j<2;j++)
            for (int k=0;k<2;k++)
            {
                if (!f[i][j][k]) continue;
                //printf("%d %d %d %d\n",i,j,k,f[i][j][k]);
                int p=f[i][j][k],kk;
                if (i==len) {ans+=p;continue;}
                for (int l=0;l<=9 && (!k || l<=a[i+1]);l++)
                {
                    if (l==4 || j==1 && l==2) continue;
                    if (k && l==a[i+1]) kk=1;
                    else kk=0;
                    f[i+1][l==6][kk]+=p;
                }
            }
    return ans-1;
}
int main()
{
    while(true)
    {
        scanf("%d%d",&n,&m);
        if (n==0 && m==0) break;
        printf("%d\n",solve(m)-solve(n-1));
    }
    return 0;
}