CodeForces 731A Night at the Museum

最新推荐文章于 2022-07-06 17:16:11 发布

原创最新推荐文章于 2022-07-06 17:16:11 发布 · 735 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#CodeForces

CF 专栏收录该内容

52 篇文章

订阅专栏

本文介绍了一个关于在博物馆打印展品名称的算法问题。任务是在给定的限制条件下，使用一个特殊的设备以最少的操作数来打印出指定的字符串。文章探讨了如何通过计算每个字符之间的最小旋转距离来解决这个问题。

Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he receivedembosser and was to take stock of the whole exposition.

Embosser is a special devise that allows to "print" the text of a plastic tape. Text is printed sequentially, character by character. The device consists of a wheel with a lowercase English letters written in a circle, static pointer to the current letter and a button that print the chosen letter. At one move it's allowed to rotate the alphabetic wheel one step clockwise or counterclockwise. Initially, static pointer points to letter 'a'. Other letters are located as shown on the picture:

$\text{[math]}$

After Grigoriy add new item to the base he has to print its name on the plastic tape and attach it to the corresponding exhibit. It's not required to return the wheel to its initial position with pointer on the letter 'a'.

Our hero is afraid that some exhibits may become alive and start to attack him, so he wants to print the names as fast as possible. Help him, for the given string find the minimum number of rotations of the wheel required to print it.

Input

The only line of input contains the name of some exhibit — the non-empty string consisting of no more than 100 characters. It's guaranteed that the string consists of only lowercase English letters.

Output

Print one integer — the minimum number of rotations of the wheel, required to print the name given in the input.

Examples

input
zeus

output
18

input
map

output
35

input
ares

output

34

#include <iostream>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#include <stdio.h>
#include <algorithm>

using namespace std;
char a[105];
int main()
{
    char now;
    scanf("%s",a);
    now='a';
    int ans=0;
    for(int i=0;a[i];i++)
    {
        ans+=min(abs(a[i]-now),min(abs(a[i]+26-now),abs(now+26-a[i])));
        now=a[i];
    }
    printf("%d\n",ans);
    return 0;
}