Red Huang

Red Huang

Codeforces Round #325 (Div. 2)

**A. Alena's Schedule **

 Add 1 each time there is a 1, if there are no 1s, check if there are two 0s and do not add 1

 The key point is to ignore the initial 0

B. Laurenty and Shop
Add up all the paths, sort them, take the smallest two and add them together
C. Gennady the Dentist

The problem statement is not very clear whether the children cry before moving positions or move first and then continue crying

But upon closer inspection, it is noted that crying occurs before moving positions

So the volume of crying children inside the dentist's office is transmitted outside based on the state at that time

After that, it's quite simple

Loading...
Ownership of this post data is guaranteed by blockchain and smart contracts to the creator alone.