数位DP简单题复习

灬德布罗意的猫灬

已于 2024-03-28 16:53:04 修改

阅读量172

点赞数 4

分类专栏： DP 文章标签：深度优先算法图论 leetcode 数据结构动态规划

于 2024-03-28 16:52:47 首次发布

本文链接：https://blog.csdn.net/m0_60921016/article/details/137117178

版权

DP 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

DFS 模板

#include<bits/stdc++.h>
using namespace std;
const int N=20;
int dp[N][N];
int a[N],len;
int n,m;
 
//pos 代表当前位置 limit是当前位置是否有这个枚举范围限制
 
int dfs(int pos,int pre,int limit){
	if(!pos)return 1;
	if(!limit&&~dp[pos][pre])return dp[pos][pre];
	
	int res = 0,up = limit?a[pos]:9;
	for(int i=0;i<=up;i++){
		if(i==4||(i==2&&pre==6))continue;
		res += dfs(pos-1,i,limit&&i==up);
	}
	
	return limit?res:dp[pos][pre] = res;
}
 
int cal(int x){
	memset(dp,-1,sizeof dp);
	len = 0;
	while(x)a[++len] = x%10,x/=10;
	return dfs(len,0,1);
}
 
int main()
{
	
	while(cin>>n>>m,n){
		cout<<cal(m)-cal(n-1)<<'\n';
	}
	
}

带前导0

#include<bits/stdc++.h>
using namespace std;
const int N=20;
int dp[N][N];
int a[N],len;
 
 
int dfs(int pos,int pre,int lead,int limit){
	if(!pos)return 1;
	if(!lead&&!limit&&~dp[pos][pre])return dp[pos][pre];
	
	int res = 0,up = limit?a[pos]:9;
	for(int i=0;i<=up;i++){
		if(abs(i-pre)<2)continue;
		if(lead&&!i)res+=dfs(pos-1,-2,lead&&!i,limit&&i==up);
		else res+=dfs(pos-1,i,lead&&!i,limit&&i==up);
	}
	
	return lead?res:(limit?res:dp[pos][pre] = res);
}
 
int cal(int x){
	memset(dp,-1,sizeof dp);
	len = 0;
	while(x)a[++len] = x%10,x/=10;
	return dfs(len,-2,1,1);
}
 
int n,m;
int main()
{
	cin>>n>>m;
	cout<<cal(m)-cal(n-1)<<'\n';
}

数字游戏

#include<iostream>
#include<cstring>
using namespace std;
const int N = 305;
int dp[N][N];
int a[N];


int dfs(int len,int last,int limit){
	if(!len)return 1;
	if(!limit&&~dp[len][last])return dp[len][last];
	
	int up = limit?a[len]:9;
	int res = 0;
	for(int i=0;i<=up;++i){
		if(i<last)continue;
		res += dfs(len-1,i,limit&&i==up);
	}
	
	return limit?res:dp[len][last] = res;
	
	
}



int cal(int x){
	
	memset(dp,-1,sizeof dp);
	int len = 0;	
	while(x){
		a[++len] = x%10;
		x/=10;
	}
	return dfs(len,0,1);
		
}

int main()
{
	int l,r;
	while(cin>>l>>r){
		cout<<cal(r)-cal(l-1)<<"\n";
	}
}

Windy 数

#include<bits/stdc++.h>
using namespace std;
const int N = 55;
int dp[N][N];
int a[N];


int dfs(int len,int last,int limit,int lead){
	if(!len)return 1;
	if(!limit&&!limit&&~dp[len][last])return dp[len][last];
	int res = 0;
	
	int up = limit?a[len]:9;
	for(int i=0;i<=up;++i){
		if(abs(i-last)<2)continue;
		if(!i&&lead)res+=dfs(len-1,-2,limit&&i==up,lead&&!i);
		else res+=dfs(len-1,i,limit&&i==up,lead&&!i);
	}
	
	return limit?res:(lead?res:dp[len][last]=res);
	
}


int cal(int x){
	memset(dp,-1,sizeof dp);
	int len = 0;
	while(x)a[++len] = x%10,x/=10;
	return dfs(len,-2,1,1);
}


int main()
{
	int l,r;
	cin>>l>>r;
	cout<<cal(r)-cal(l-1)<<"\n";
}

数字游戏II

#include<bits/stdc++.h>
using namespace std;
const int N = 55;
int dp[N][1000];
int a[N];
int c;


int dfs(int len,int s,int limit){
	
	if(!len)return s%c==0;
	if(!limit&&~dp[len][s])return dp[len][s];
	int res = 0;
	int up = limit?a[len]:9;
	for(int i=0;i<=up;++i){
		res+=dfs(len-1,s+i,limit&&i==up);
	}
	
	return limit?res:dp[len][s] = res;
	
	
}


int cal(int x){
	memset(dp,-1,sizeof dp);
	int len = 0;
	while(x)a[++len] = x%10,x/=10;
	return dfs(len,0,1);
}


int main()
{
	int l,r;
	while(cin>>l>>r>>c)cout<<cal(r)-cal(l-1)<<"\n";
	
}

不要62

#include<iostream>
#include<cstring>
using namespace std;
const int N = 35;
int dp[N][N];
int a[N];


int dfs(int len,int last,int limit){
	if(!len)return 1;
	if(!limit&&~dp[len][last])return dp[len][last];
	int up = limit?a[len]:9;
	
	int res = 0;
	for(int i=0;i<=up;++i){
		if(i==4)continue;
		if(last==6&&i==2)continue;
		res+=dfs(len-1,i,limit&&i==up);
	}
	
	return limit?res:dp[len][last] = res;
	
}




int cal(int x){
	
	memset(dp,-1,sizeof dp);
	int len = 0;	
	while(x){
		a[++len] = x%10;
		x/=10;
	}
	return dfs(len,0,1);
		
}

int main()
{
	int l,r;
	while(cin>>l>>r,l){
		cout<<cal(r)-cal(l-1)<<"\n";
	}
}