超级会员免费看
本文介绍了B-number的概念，即包含子串'13'且能被13整除的非负整数。文章提出了一个编程挑战，要求计算从1到给定整数n之间有多少个B-number。对于输入范围1到1000000000的正整数n，给出了样例输出。解决方案包括使用记忆化深度优先搜索和数位动态规划的方法来求解。
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
题意：找出1~n范围内含有13并且能被13整除的数字的个数
思路：使用记忆化深搜来记录状态，配合数位DP来解决
订阅专栏 解锁全文
扫一扫
420
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
