Problem Description
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.Mikhail wa
阅读背景：
Codeforces 954A - Diagonal Walking（简单数学）
来源：互联网
分享到：
