切割 被3整除

D - Polycarp and Div 3

Polycarp likes numbers that are divisible by 3.

He has a huge number s. Polycarp wants to cut from it the maximum number of numbers that are divisible by 3. To do this, he makes an arbitrary number of vertical cuts between pairs of adjacent digits. As a result, after m such cuts, there will be m+1 parts in total. Polycarp analyzes each of the obtained numbers and finds the number of those that are divisible by 3.

For example, if the original number is s=3121, then Polycarp can cut it into three parts with two cuts: 3|1|21. As a result, he will get two numbers that are divisible by 3.

Polycarp can make an arbitrary number of vertical cuts, where each cut is made between a pair of adjacent digits. The resulting numbers cannot contain extra leading zeroes (that is, the number can begin with 0 if and only if this number is exactly one character ‘0’). For example, 007, 01 and 00099 are not valid numbers, but 90, 0 and 10001 are valid.

What is the maximum number of numbers divisible by 3 that Polycarp can obtain?

Input
The first line of the input contains a positive integer s. The number of digits of the number s is between 1 and 2⋅105, inclusive. The first (leftmost) digit is not equal to 0.

Output
Print the maximum number of numbers divisible by 3 that Polycarp can get by making vertical cuts in the given number s.

Examples

Input
3121

Output
2

Input
6

Output
1

Input
1000000000000000000000000000000000

Output
33

Input
201920181

Output
4

Note
In the first example, an example set of optimal cuts on the number is 3|1|21.
In the second example, you do not need to make any cuts. The specified number 6 forms one number that is divisible by 3.
In the third example, cuts must be made between each pair of digits. As a result, Polycarp gets one digit 1 and 33 digits 0. Each of the 33 digits 0 forms a number that is divisible by 3.
In the fourth example, an example set of optimal cuts is 2|0|1|9|201|81. The numbers 0, 9, 201 and 81 are divisible by 3.

题目大意就是给一个段数字最大不超过2*e^5然后对数字进行分割，最长不超过数字原长。首先输入数字可能会很大就不能用整形来输入而要用字符串。其次若是连续三个数单列出来或是两两结合均无法被3整除那么这个三位数一定可以被3整除。若是一个数字可被3整除那么就将计数加一，继续向后推进。

#include <iostream>
#include <cstdio>
#include <string.h>

using namespace std;

int main()
{
    int a=2e5;                          //即a=2*1.2*10*10*10*10*10
    char x[a];
    gets(x);
    int b,c=0,d=0,e=strlen(x),sum=0;
    for(int i=0;i<e;i++)
    {
        b=x[i]-'0';					    //将字符型数字转化为整形
        sum+=b*10;
        c++;
        if(c==3||b%3==0||sum%3==0){     //若是连续三个相邻的数单个或两两组合均无法被3整除那么这三个数组成的三位数一定可以被3整除
            d++;
            c=0;
            sum=0;
        }
    }
    printf("%d",d);
    //cout<<a;
}