HDU - 3652 B-number (数位dp）

题目链接：http://acm.hdu.edu.cn/showproblem.php?pid=3652点击打开链接

B-number

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7460    Accepted Submission(s): 4375

Problem Description

A wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbers, but 143 and 2639 are not. Your task is to calculate how many wqb-numbers from 1 to n for a given integer n.

 

Input

Process till EOF. In each line, there is one positive integer n(1 <= n <= 1000000000).

 

Output

Print each answer in a single line.

 

Sample Input

  
  

   
   13
100
200
1000
  
  

 

Sample Output

  
  

   
   1
1
2
2
  
  

 

按版子打的 至于理解目前还没那么透彻

#include <bits/stdc++.h>
using namespace std;
int num[20];
int dp[20][20][3];
int dfs(int pos,int mod,int have,int limit)
{
	if(pos==0)
		return mod==0&&have==2;
	if(!limit&&dp[pos][mod][have])
		return dp[pos][mod][have];
	int up=limit?num[pos]:9;
	int ans=0;
	for(int i=0;i<=up;i++)
	{
		int midmod=(mod*10+i)%13;
		int midhave=have;
		if(have==0&&i==1)
			midhave=1;
		if(have==1&&i!=1)
			midhave=0;
		if(have==1&&i==3)
			midhave=2;
		ans+=dfs(pos-1,midmod,midhave,limit&&i==up);
	}
	if(!limit)
		dp[pos][mod][have]=ans;
	return ans;
}
int main()
{
	int n;
	while(cin >> n)
	{
		memset(num,0,sizeof(num));
		memset(dp,0,sizeof(dp));
		int len=0;
		while(n)
		{
			num[++len]=n%10;
			n/=10;
		}
		cout << dfs(len,0,0,1) << endl;
	}
}