2 人解决，12 人已尝试。
11 份提交通过，共有 28 份提交。
9.4 EMB 奖励。
单点时限: 5.0 sec
内存限制: 256 MB
Since mass transit was invented, people who buy tickets look for lucky ticket numbers. There are many notions of lucky tickets, for example sometimes tickets are considered lucky if the sum of first half of the digits is equal to the sum of the second half, sometimes the product is used instead of the sum, sometimes permutation of digits is allowed, etc.
In St Andrewburg integer numbers from $1$ to $n$ are used as ticket numbers. Bill considers a ticket lucky if its number is divisible by the sum of its digits. Help Bill to find the number of lucky tickets.
The first line of the input file contains $n$ ($1 \le n \le 10^{12}$).
Output one number ― the number of lucky tickets.
100
33
2 人解决，12 人已尝试。
11 份提交通过，共有 28 份提交。
9.4 EMB 奖励。