Codeforces Round #376 (Div. 2), problem: (A) Night at the Museum

To solve this problem, we can iterate through the characters of the input string and calculate the minimum number of moves required to change from one letter to the next. We can achieve this by calculating the absolute difference between the ASCII values of the current and next characters, taking the minimum of the clockwise and counterclockwise distances, and summing these distances for each pair of adjacent characters. Finally, we output the total sum of distances as the minimum number of moves required.