Editorial for Mock CCC '19 Contest 2 J2 - Tudor Drinks Some More Tea


Remember to use this editorial only when stuck, and not to copy-paste code from it. Please be respectful to the problem author and editorialist.
Submitting an official solution before solving the problem yourself is a bannable offence.

To solve the subtask, it suffices to check if there is any jelly present. If so, print 1, otherwise print 0.

To solve the problem fully, there are a couple approaches. One is to concatenate all the letters, repeatedly replace all instances of JJ with J, and then count how many times J appears in that string. Another approach is to loop over the letters and specifically track the first part of each chunk of jelly.


Comments

There are no comments at the moment.