摘要：
F. Equalizing Two Strings You are given two strings s and t both of length n and both consisting of lowercase Latin letters. In one move, you can choo 阅读全文
摘要：
E. Yet Another Division Into Teams There are n students at your university. The programming skill of the i th student is ai. As a coach, you want to d 阅读全文
摘要：
D. Binary String Minimizing You are given a binary string of length n (i. e. a string consisting of n characters '0' and '1'). In one move you can swa 阅读全文
摘要：
C. Platforms Jumping There is a river of width n. The left bank of the river is cell 0 and the right bank is cell n+1 (more formally, the river can be 阅读全文
摘要：
B. Minimize the Permutation You are given a permutation of length n. Recall that the permutation is an array consisting of n distinct integers from 1 阅读全文
摘要：
A. Payment Without Change You have a coins of value n and b coins of value 1. You always pay in exact change, so you want to know if there exist such 阅读全文