B-number HDU - 3652 (数位dp+容斥原理)

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

 

题意：求小于等于n的可以被13整除的并且包含13的数有多少个

用容斥原理n减去不能被13整除的减去不含13的，中间多减了，需要加上既不包含13也不能被13整除的数的个数就是答案

代码如下：

 

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