数位dp 专题

终于搞懂dfs写法

link1

#include <bits/stdc++.h>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first 
#define y second
#define pb  push_back
#define inf 1e18
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--) 
const int maxn=1e5+10;
const int mod=1e9+7;
int qmi(int a,int b)
{int res=1;  while(b){  if(b&1) res=res*a%mod;  a=a*a%mod;  b>>=1; } return res;}
const int N=40;
int dr[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
int dp[N][2];
int m;
int a[N];
int dfs(int pos,int sta,bool lim)
{
	if(pos==-1)return 1;
	if(!lim&&dp[pos][sta]!=-1)return dp[pos][sta];
	int up=lim?a[pos]:9;
	int ans=0;
	fer(i,0,up)
	{
		if(sta&&i==2)continue;
		if(i==4)continue;
		ans+=dfs(pos-1,i==6,lim&i==a[pos]);
	}
	if(!lim)dp[pos][sta]=ans;
	return ans;
}
int so(int x)
{
	int pos=0;
	while(x)
	{
		a[pos++]=x%10;
		x/=10;
	}
	return dfs(pos-1,0,true);
}
void solve()
{
	memset(dp,-1,sizeof(dp));
	while(cin>>n>>m&&(n||m))
	{
		cout<<so(m)-so(n-1)<<endl;
	}
}

signed main()
{
	IOS;
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}

link2

带前导0的

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first 
#define y second
#define pb  push_back
#define inf 1e18
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--) 
const int maxn=1e5+10;
const int mod=1e9+7;
int qmi(int a,int b)
{int res=1;  while(b){  if(b&1) res=res*a%mod;  a=a*a%mod;  b>>=1; } return res;}
const int N=40;
int dr[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
int dp[N][75];
int m;
int a[N];
int dfs(int pos,int cnt,bool le, bool lim)
{
	if(pos==-1)return cnt>=32;
	if(!le&&!lim&&dp[pos][cnt]!=-1)return dp[pos][cnt];
	int up=lim?a[pos]:1;
	int ans=0;
	fer(i,0,up)
	{
		if(le&&i==0) ans+=dfs(pos-1,cnt,le,lim&&i==a[pos]);
		else ans+=dfs(pos-1,cnt+(!i?1:-1),le&&i==0,lim&&i==a[pos]);
	}
	if(!lim&&!le)dp[pos][cnt]=ans;
	return ans;
}
int so(int x)
{
	int pos=0;
	while(x)
	{
		a[pos++]=x&1;
		x>>=1;
	}
	return dfs(pos-1,32,true,true);
}
void solve()
{
	memset(dp,-1,sizeof(dp));
    cin>>n>>m;
//	cout<<so(m)<<" "<<so(n-1)<<endl;
	cout<<so(m)-so(n-1)<<endl;
}

signed main()
{
	IOS;
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}

link3

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first 
#define y second
#define pb  push_back
#define inf 1e18
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--) 
const int maxn=1e5+10;
const int mod=1e9+7;
int qmi(int a,int b)
{int res=1;  while(b){  if(b&1) res=res*a%mod;  a=a*a%mod;  b>>=1; } return res;}
const int N=40;
int dr[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
int dp[N][N][3010];
int m;
int a[N];
int dfs(int pos,int cn,int sum,int lim)
{
	if(!pos)return sum==0;
	if(sum<0) return 0;
	if(dp[pos][cn][sum]!=-1&&!lim) return dp[pos][cn][sum];
	int up=lim?a[pos]:9;
	int ans=0;
	fer(i,0,up)
	{
	ans+=dfs(pos-1,cn,sum+i*(pos-cn),lim&&i==up);	
	}
	if(!lim)dp[pos][cn][sum]=ans;
	return ans;
}
int so(int x)
{
	int pos=0;
	while(x)
	{
		a[++pos]=x%10;
		x/=10;
	}
	int ans=0;
    fer(i,1,pos)
	ans+=dfs(pos,i,0,1);
    return ans-pos+2;
}
void solve()
{
	memset(dp,-1,sizeof(dp));
    cin>>n>>m;
//	cout<<so(m)<<" "<<so(n-1)<<endl;
	cout<<so(m)-so(n-1)<<endl;
}

signed main()
{
	IOS;
	int _;
	cin>>_;
	while(_--) solve();
	return 0;
}

link4

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace  std;
#define  int long long
//typedef long long ll;
typedef pair<int,int> pii;
#define x first 
#define y second
#define pb  push_back
#define inf 1e18
#define IOS   std::ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define  fer(i,a,b)  for(int i=a;i<=b;i++)
#define  der(i,a,b)  for(int i=a;i>=b;i--) 
const int maxn=1e5+10;
const int mod=1e9+7;
int qmi(int a,int b)
{int res=1;  while(b){  if(b&1) res=res*a%mod;  a=a*a%mod;  b>>=1; } return res;}
const int N=40;
int dr[4][2]={{-1,0},{1,0},{0,-1},{0,1}};
int n,k;
int dp[20010][220];
int m;
int a[10010];
int dfs(int pos,int sum,int lim)
{
	if(!pos)return sum==0;
	if(dp[pos][sum]!=-1&&!lim) return dp[pos][sum];
	int up=lim?a[pos]:9;
	int ans=0;
	fer(i,0,up)
	{
	ans= (ans+dfs(pos-1,(sum+i)%m,i==up&&lim))%mod ;	
	}
	if(!lim)dp[pos][sum] =ans;
	return ans;
}

void solve()
{
	memset(dp,-1,sizeof(dp));
    string s;
    cin>>s>>m;
    int n=s.size();
    reverse(s.begin(),s.end());
    s=" "+s;
  //  fer(i,1,n)cout<<s[i];
    fer(i,1,n) a[i]=s[i]^48;
    int ans=dfs(n,0,1);
	cout<<(ans-1+mod)%mod<<endl;
}

signed main()
{
	IOS;
	int _=1;
	//cin>>_;
	while(_--) solve();
	return 0;
}