CF387C.George and Number

普及/提高-

通过率:0%

AC君温馨提醒

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

题目描述

George is a cat, so he really likes to play. Most of all he likes to play with his array of positive integers bb . During the game, George modifies the array by using special changes. Let's mark George's current array as b1,b2,...,bbb_{1},b_{2},...,b_{|b|} (record b|b| denotes the current length of the array). Then one change is a sequence of actions:

  • Choose two distinct indexes ii and jj (1<=i,j<=b; ij)(1<=i,j<=|b|; i≠j) , such that bi>=bjb_{i}>=b_{j} .
  • Get number v=concat(bi,bj)v=concat(b_{i},b_{j}) , where concat(x,y)concat(x,y) is a number obtained by adding number yy to the end of the decimal record of number xx . For example, concat(500,10)=50010concat(500,10)=50010 , concat(2,2)=22concat(2,2)=22 .
  • Add number vv to the end of the array. The length of the array will increase by one.
  • Remove from the array numbers with indexes ii and jj . The length of the array will decrease by two, and elements of the array will become re-numbered from 11 to current length of the array.

George played for a long time with his array bb and received from array bb an array consisting of exactly one number pp . Now George wants to know: what is the maximum number of elements array bb could contain originally? Help him find this number. Note that originally the array could contain only positive integers.

输入格式

The first line of the input contains a single integer pp ( 1<=p<10^{100000} ). It is guaranteed that number pp doesn't contain any leading zeroes.

输出格式

Print an integer — the maximum number of elements array bb could contain originally.

输入输出样例

  • 输入#1

    9555
    

    输出#1

    4
  • 输入#2

    10000000005
    

    输出#2

    2
  • 输入#3

    800101
    

    输出#3

    3
  • 输入#4

    45
    

    输出#4

    1
  • 输入#5

    1000000000000001223300003342220044555
    

    输出#5

    17
  • 输入#6

    19992000
    

    输出#6

    1
  • 输入#7

    310200
    

    输出#7

    2

说明/提示

Let's consider the test examples:

  • Originally array bb can be equal to 5,9,5,5{5,9,5,5} . The sequence of George's changes could have been: 5,9,5,55,5,9595,559555{5,9,5,5}→{5,5,95}→{95,55}→{9555} .
  • Originally array bb could be equal to 1000000000,5{1000000000,5} . Please note that the array bb cannot contain zeros.
  • Originally array bb could be equal to 800,10,1{800,10,1} .
  • Originally array bb could be equal to 45{45} . It cannot be equal to 4,5{4,5} , because George can get only array 54{54} from this array in one operation.

Note that the numbers can be very large.

首页