HDU-2089 不要62 数位DP 模板题

来源：互联网发布：sql数据库设计工具编辑：程序博客网时间：2024/06/14 14:10

题目链接

#include<stdio.h>#include<iostream>#include<string>#include<string.h>#include<math.h>#include<functional>#include<algorithm>#include<vector>#include<queue>using namespace std;const int maxn = 15; int n,m;int dp[maxn][3],digit[maxn];int dfs( int pos,int st,bool flag ){if( !pos ) return st == 2;if( flag && dp[pos][st] != -1 )return dp[pos][st];int ans = 0;int u = flag?9:digit[pos];for( int i = 0; i <= u; i ++ ){if( st == 2 || i == 4 || ( st == 1 && i == 2 ) )ans += dfs( pos-1,2,flag||i<u );else if( i == 6 ) ans += dfs( pos-1,1,flag||i<u );else ans += dfs( pos-1,0,flag||i<u );}if( flag )dp[pos][st] = ans;return ans;}int fun( int x ){int len = 0;while( x ){digit[++len] = x%10;x /= 10;}return dfs( len,0,0 );}int main() {#ifndef ONLINE_JUDGE    freopen("data.txt","r",stdin);#endifmemset( dp,-1,sizeof(dp) );while( scanf("%d%d",&n,&m) != EOF,(n||m) ){printf("%d\n",m-n+1 - fun(m) + fun(n-1));}    return 0;}

0 0