Codeforce Round #227 Div2 C

Codeforces Round #227 (Div. 2)
Finished
Practice

→ Practice

You are registered for practice. You can solve problems unofficially. Results can be found in the contest status and in the bottom of standings.

→ Submit?

→ Last submissions

Submission	Time	Verdict
5930214	02/10/2014 02:44AM	Accepted
5930209	02/10/2014 02:41AM	Accepted
5930199	02/10/2014 02:37AM	Wrong answer on test 1
5930198	02/10/2014 02:36AM	Wrong answer on test 1
5930193	02/10/2014 02:35AM	Wrong answer on test 1
5849911	01/30/2014 09:26PM	Wrong answer on pretest 10

→ Problem tags

greedy

implementation

No tag edit access

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

Choose two distinct indexes i and j (1 ≤ i, j ≤ |b|; i ≠ j), such that b_i ≥ b_j.
Get number v = concat(b_i, b_j), where concat(x, y) is a number obtained by adding number y to the end of the decimal record of number x. For example, concat(500, 10) = 50010, concat(2, 2) = 22.
Add number v to the end of the array. The length of the array will increase by one.
Remove from the array numbers with indexes i and j. The length of the array will decrease by two, and elements of the array will become re-numbered from 1 to current length of the array.

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

Input

The first line of the input contains a single integer p (1 ≤ p < 10¹⁰⁰⁰⁰⁰). It is guaranteed that number p doesn't contain any leading zeroes.

Output

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

Sample test(s)

Input

Output

Input

10000000005

Output

Input

Output

Input

Output

Input

1000000000000001223300003342220044555

Output

Input

19992000

Output

Input

Output

Note

Let's consider the test examples:

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

Note that the numbers can be very large.

 1 #pragma comment(linker,"/STACK:102400000,102400000")
 2 #include <cstdio>
 3 #include <vector>
 4 #include <cmath>
 5 #include <queue>
 6 #include <set>
 7 #include <cstring>
 8 #include <iostream>
 9 #include <algorithm>
10 using namespace std;
11 #define INF 0x7fffffff 
12 #define mod 1000000007
13 #define ll long long
14 #define maxn 1000005
15 #define pi acos(-1.0)
16 #define dis(a, b) sqrt((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y))
17 ll gcd(ll n, ll m){ return m ? gcd(m, n%m) : n; }
18 int n, m, k, c, a, b, x, y;
19 struct node{int a, b;}p[maxn];
20 bool cmp(node a, node b){ return (a.a < b.a || a.a == b.a&&a.b < b.b); }
21 char s[maxn];
22 int main(){
23     scanf("%s", s);
24     n = strlen(s);
25     for (int i = n - 1; i >= 0; i--){
26         x++;
27         if (s[i] == '0')continue;
28         if (x < i || x == i&&s[i] <= s[0])x=0, k++;
29     }
30     k++;
31     printf("%d\n", k);
32     return 0;
33 }

View Code

posted @ 2014-02-10 06:53 HaibaraAi 阅读(179) 评论(0) 收藏举报

刷新页面返回顶部

Language:
Choose file:
Be careful: there is 50 points penalty for submission which fails the pretests or resubmission (except failure on the first test, denial of judgement or similar verdicts). "Passed pretests" submission verdict doesn't guarantee that the solution is absolutely correct and it will pass system tests.