#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#include<cmath>
#include<cstdlib>
#include<ctime>
using namespace std;
typedef long long ll;
const int inf=0x3f3f3f3f;
inline int read(){
char ch=' ';int f=1;int x=0;
while(ch<'0'||ch>'9'){if(ch=='-') f=-1;ch=getchar();}
while(ch>='0'&&ch<='9')x=x*10+ch-'0',ch=getchar();
return x*f;
}
int dp[20][2];
int a[20];
int dfs(int pos,int pre,int state,bool limit)
{
if(pos==0) return 1.;
if(!limit&&dp[pos][state]!=-1) return dp[pos][state];
int up=limit?a[pos]:9;
int ans=0;
for(int i=0;i<=up;i++)
{
if(i==4) continue;
if(pre==6&&i==2) continue;
ans+=dfs(pos-1,i,i==6,limit&&i==a[pos]);
}
if(!limit) dp[pos][state]=ans;
return ans;
}
int solve(int x)
{
int pos=0;
while(x)
{
a[++pos]=x%10;
x/=10;
}
return dfs(pos,0,0,1);
}
int main()
{
int l,r;
while(scanf("%d%d",&l,&r)!=EOF)
{
if(l==0&&r==0)
{
break;
}
memset(dp,-1,sizeof(dp));
printf("%d\n",solve(r)-solve(l-1));
}
return 0;
}
数位dp模板_不要62
猜你喜欢
转载自blog.csdn.net/qq_42110318/article/details/83830604
今日推荐
周排行