Codeforces Round 605 (Div. 3) My Unofficial Editorial
This Round Sucks… I solved first three problems in about an hour but stuck in problem D. Good Problems though! A. Three Friends Problem Link At first, I was thinking of checking all the number of cases. However, I found a way to solve by sorting to find the first, middle and the last friend. If two of them are staying together, the all of them mo…