1005D - Polycarp and Div 3

D. Polycarp and Div 3

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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\cdot {10}^5$, 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

Copy

3121

output

Copy

2

input

Copy

6

output

Copy

1

input

Copy

1000000000000000000000000000000000

output

Copy

33

input

Copy

201920181

output

Copy

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$.

题意：输入一串字符，划分数字，计算最多有多少能够被3整除的数字。

题解：贪心 数论 判断每一位能否整除3，就ans++，在记录前缀和，判断是否加起来的数字是否是3的倍数（这个定理好像是小学的，判断多位数字的数，把每一位求和看是否是3的倍数），还要记录用了多少个个数，如果等于3，ans++。如果三个连续的数都不是3的倍数，那么对于前面两个数来说，他们对3求余只可能是同时余1或者同时余2的情况，（因为如果为[1,2]或者[2,1]的话加起来就可以整除3了），然后对于第三个数对3取余可能是1或者2，如果是1，三个数的余可能是[111]，那就全部取，是3的倍数，如果是[221],取后面的两个，如果最后一个数模3为2，三个数的余可能是[112],取后面两个，如果是[222]取全部。

c++：

#include<bits/stdc++.h>
using namespace std;
string s;
int ans,pre,cnt;
int main()
{
    cin>>s;
    for(int i=0; i<s.size(); i++)
    {
        pre+=s[i]-'0';
        cnt++;
        if(cnt==3||(s[i]-'0')%3==0||pre%3==0)
            ans++,pre=0,cnt=0;
    }
    cout<<ans<<endl;
    return 0;
}

python：

a=input()
ans=0
pre=0;cnt=0
for i in a:
    pre+=int(i)
    if cnt==3 or pre%3==0 or int(i)%3==0:
        ans+=1
        pre=0;cnt=0
print(ans)