hdu3652 B-number（数位dp+dfs）

B-number

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

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

Author

wqb0039

Source

2010 Asia Regional Chengdu Site —— Online Contest 

题意：找出1~n有多少个数既含有13又能被13整除。

分析：记忆化搜索配合数位dp求解。

#include 
#include 
#include 
#include 
#include 
#include