codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

1005D.md (2315B)


      1 Source: https://codeforces.com/problemset/problem/1005/D
      2 
      3 D. Polycarp and Div 3
      4 
      5 time limit per test
      6 
      7 3 seconds
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 standard input
     16 
     17 output
     18 
     19 standard output
     20 
     21 Polycarp likes numbers that are divisible by 3.
     22 
     23 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$.
     24 
     25 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$.
     26 
     27 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.
     28 
     29 What is the maximum number of numbers divisible by $3$ that Polycarp can obtain?
     30 
     31 Input
     32 
     33 The first line of the input contains a positive integer $s$. The number of digits of the number $s$ is between $1$ and $2\cdot10^5$, inclusive. The first (leftmost) digit is not equal to 0.
     34 
     35 Output
     36 
     37 Print the maximum number of numbers divisible by $3$ that Polycarp can get by making vertical cuts in the given number $s$.
     38 
     39 Examples
     40 
     41 Input
     42 
     43 ```
     44 3121
     45 ```
     46 
     47 Output
     48 
     49 ```
     50 2
     51 ```
     52 
     53 Input
     54 
     55 ```
     56 6
     57 ```
     58 
     59 Output
     60 
     61 ```
     62 1
     63 ```
     64 
     65 Input
     66 
     67 ```
     68 1000000000000000000000000000000000
     69 ```
     70 
     71 Output
     72 
     73 ```
     74 33
     75 ```
     76 
     77 Input
     78 
     79 ```
     80 201920181
     81 ```
     82 
     83 Output
     84 
     85 ```
     86 4
     87 ```
     88 
     89 Note
     90 
     91 In the first example, an example set of optimal cuts on the number is 3|1|21.
     92 
     93 In the second example, you do not need to make any cuts. The specified number 6 forms one number that is divisible by $3$.
     94 
     95 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$.
     96 
     97 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$.