数位dp之 简单板子题

HDU 3652  B-number

B-number就是连续出现13连个数字并且能被13整除的数，我们只需要传递一下数字看看是否可以mod然后看一下有没有连续出现的13即可 

//B-number
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int mm=15;

int dp[mm][mm][3];// pos, mod, 
//末尾： 0-不是1  1-是1  2-有13  
int a[mm];

int dfs(int pos,int mod,int have,int limit){
	if(pos<0)return mod==0&&have==2;//倍数而且有13  
	if(!limit&&dp[pos][mod][have]!=-1)
		return dp[pos][mod][have];
	int res=0;
	int up=limit?a[pos]:9;
	for(int i=0;i<=up;i++){
		int modx=(mod*10+i)%13;//向下传值 
		int havex;
//		if(have==0&&i!=1)havex=0;// 
//		if(have==0&&i==1)havex=1;//
//		if(have==1&&i!=1)havex=0;//
//		if(have==1&&i==1)havex=1;//
		if(i!=1)havex=0;
		else havex=1;
		if(have==1&&i==3||have==2)havex=2;//一定要放在后面 
		res+=dfs(pos-1,modx,havex,limit&&i==up);
	}
	if(!limit)dp[pos][mod][have]=res;;
	return res;
}

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

int main()
{
	int n;
	while(scanf("%d",&n)!=EOF){
		int res=solve(n);
		cout<<res<<endl;
	} 
	return 0;
}

HDU-2089 不要62

杭州人居然不喜欢有62和4的车牌？？？这道题更简单，测试的时候直接盲敲

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#define mem(a,b) memset(a,b,sizeof(a))
#define ll long long
using namespace std;
const int inf=0x3f3f3f3f;
const int mm=10;

int dp[mm][mm];
int a[mm];

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

int solve(int x){
	int cnt=0;
	mem(dp,-1);
	while(x){
		a[cnt++]=x%10;
		x/=10;	
	}
	return dfs(cnt-1,0,1);
}


int main()
{
	int x,y;
	while(scanf("%d%d",&x,&y)!=EOF){
		if(x==0&&y==0)break;
		int res=solve(y)-solve(x-1);
		cout<<res<<endl; 
	}
	return 0;
}

POJ3252-Round Number

当你把一个数转换为二进制，如果0的个数比1的个数多，那么这个数就叫 round-number

需要注意的就是判断是否有前导0

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#define ll long long
using namespace std;
const ll inf=0x3f3f3f3f;
const ll mm=40;
ll dp[mm][mm][mm];//dp[pos][num0][num1]表示pos位数，二进制0的个数不小于1的个数的数的个数 
ll a[mm];

ll dfs(ll pos,ll num0,ll num1,bool lead,bool limit){
//当前的位数，0的个数，1的个数，前导为0则为true，当前位受到限制则为true 
	if(pos<0)return num0>=num1;//结束，计数 
	if(!limit&&!lead&&dp[pos][num0][num1]!=-1)
		return dp[pos][num0][num1];//剪枝操作 
	ll up=limit?a[pos]:1;
	ll res=0;
	for(ll i=0;i<=up;i++){
		if(lead){//前导为0 
			if(i==0)
				res+=dfs(pos-1,num0,num1,true,i==up&&limit);//前导0的个数不算！！ 
			else 
				res+=dfs(pos-1,num0,num1+1,false,i==up&&limit);//出现了1 前导不再为0 
		}
		else{//前导不为0 
			if(i==0)
				res+=dfs(pos-1,num0+1,num1,false,i==up&&limit);
			else 
				res+=dfs(pos-1,num0,num1+1,false,i==up&&limit);
		}
	} 
	if(!limit&&!lead)//赋值记录  
		dp[pos][num0][num1]=res;
	return res;
}

ll solve(ll x){
	memset(dp,-1,sizeof(dp));
	ll cnt=0;	
	while(x){//取定二进制数 
		a[cnt++]=x%2;
		x/=2;
	}
	return dfs(cnt-1,0,0,true,true);//前导默认为0且不受限制 
}

int main()
{
	ll x,y;
	cin>>x>>y;
	ll res=solve(y)-solve(x-1);// 
	cout<<res<<endl;
	return 0;
}

CodeForces-1036C----Classy Number

一个数字，如果他的组成数字不为0的个数不超过三个，那么他就叫做 Classy-Number

仍旧要注意前导零，easy-problem

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<string>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<map>
#define ll long long
using namespace std;
const ll inf=0x3f3f3f3f;
const ll mm=20;

ll dp[mm][mm];//pos,num
ll a[mm];

ll dfs(ll pos,ll lead,ll num,ll limit){
	if(pos<0)return num<=3;
	if(!limit&&!lead&&dp[pos][num]!=-1)
		return dp[pos][num];
	ll up=limit?a[pos]:9;
	ll res=0;
	for(ll i=0;i<=up;i++){
		if(lead){//前导为0 
			if(i==0)
				res+=dfs(pos-1,1,num,limit&&i==up);
			else res+=dfs(pos-1,0,num+1,limit&&i==up);
		}
		else {
			if(i==0)
				res+=dfs(pos-1,0,num,limit&&i==up);
			else res+=dfs(pos-1,0,num+1,limit&&i==up);
		}
	}
	if(!limit&&!lead)
		dp[pos][num]=res;
	return res;
}

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

int main()
{
	ll t,n,m;
	cin>>t;
	while(t--){
		cin>>n>>m;
		ll res=solve(m)-solve(n-1);
		cout<<res<<endl;
	}
	return 0;
}