CF1142D.Foreigner

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

Traveling around the world you noticed that many shop owners raise prices to inadequate values if the see you are a foreigner.

You define inadequate numbers as follows:

  • all integers from 11 to 99 are inadequate;
  • for an integer x10x \ge 10 to be inadequate, it is required that the integer x/10\lfloor x / 10 \rfloor is inadequate, but that's not the only condition. Let's sort all the inadequate integers. Let x/10\lfloor x / 10 \rfloor have number kk in this order. Then, the integer xx is inadequate only if the last digit of xx is strictly less than the reminder of division of kk by 1111 .

Here x/10\lfloor x / 10 \rfloor denotes x/10x/10 rounded down.

Thus, if xx is the mm -th in increasing order inadequate number, and mm gives the remainder cc when divided by 1111 , then integers 10x+0,10x+1,10x+(c1)10 \cdot x + 0, 10 \cdot x + 1 \ldots, 10 \cdot x + (c - 1) are inadequate, while integers 10x+c,10x+(c+1),,10x+910 \cdot x + c, 10 \cdot x + (c + 1), \ldots, 10 \cdot x + 9 are not inadequate.

The first several inadequate integers are 1,2,3,4,5,6,7,8,9,10,20,21,30,31,321, 2, 3, 4, 5, 6, 7, 8, 9, 10, 20, 21, 30, 31, 32 \ldots . After that, since 44 is the fourth inadequate integer, 40,41,42,4340, 41, 42, 43 are inadequate, while 44,45,46,,4944, 45, 46, \ldots, 49 are not inadequate; since 1010 is the 1010 -th inadequate number, integers 100,101,102,,109100, 101, 102, \ldots, 109 are all inadequate. And since 2020 is the 1111 -th inadequate number, none of 200,201,202,,209200, 201, 202, \ldots, 209 is inadequate.

You wrote down all the prices you have seen in a trip. Unfortunately, all integers got concatenated in one large digit string ss and you lost the bounds between the neighboring integers. You are now interested in the number of substrings of the resulting string that form an inadequate number. If a substring appears more than once at different positions, all its appearances are counted separately.

输入格式

The only line contains the string ss ( 1s1051 \le |s| \le 10^5 ), consisting only of digits. It is guaranteed that the first digit of ss is not zero.

输出格式

In the only line print the number of substrings of ss that form an inadequate number.

输入输出样例

  • 输入#1

    4021
    

    输出#1

    6
    
  • 输入#2

    110
    

    输出#2

    3
    

说明/提示

In the first example the inadequate numbers in the string are 1,2,4,21,40,4021, 2, 4, 21, 40, 402 .

In the second example the inadequate numbers in the string are 11 and 1010 , and 11 appears twice (on the first and on the second positions).

首页