Editorial for Mock CCC '19 Contest 2 J1 - Tudor Drinks Some 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 are any pearls present. If so, print 1, otherwise print 0.

To solve the problem fully, count the number of P's present and print that count.


There are no comments at the moment.