Codeforces-731A A. Night at the Museum

A. Night at the Museum

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Grigoriy, like the hero of one famous comedy film, found a job as a night security guard at the museum. At first night he received embosserand 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:

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

Copy

zeus

output

Copy

18

input

Copy

map

output

Copy

35

input

Copy

ares

output

Copy

34

1. #include<iostream>
2. #include<cstring>
3. #include<cmath>
4. using namespace std;
5. int main()
6. {
7. char a[500];
8. int i;
9. while(cin>>a)
10. {
11. int t,sum=0,t1;
12. if(strlen(a)==1)
13. {
14. t=abs(a[0]-'a');
15. if(t>=13)
16. cout<<26-t<<endl;
17. else
18. cout<<t<<endl;
19. }
20. else
21. {
22. t1=abs(a[0]-'a');
23. if(t1>=13)
24. sum+=(26-t1);
25. else
26. sum+=t1;
27. for(i=1;i<strlen(a);i++)
28. {
29. t=abs(a[i]-a[i-1]);
30. if(t>=13)
31. sum+=(26-t);
32. else
33. sum+=t;
34. }
35. cout<<sum<<endl;
36. }
37. }
38. 
    

下面这个是编写了一个求两个字符之间最短步数的函数：

1. #include<iostream>
2. #include<cstring>
3. #include<cmath>
4. using namespace std;
5. int lenth(char a,char b)
6. {
7. int t;
8. t=abs(a-b);
9. if(t>=13)
10. return 26-t;
11. else
12. return t;
13. }
14. int main()
15. {
16. char a[500];
17. int i;
18. while(cin>>a)
19. {
20. int t,sum=0,t1;
21. if(strlen(a)==1)
22. cout<<lenth(a[0],'a')<<endl;
23. else
24. {
25. sum+=lenth(a[0],'a');
26. for(i=1;i<strlen(a);i++)
27. {
28. sum+=lenth(a[i],a[i-1]);
29. }
30. cout<<sum<<endl;
31. }
32. }
33. }

下面是又经过改进后的代码：

1. #include<iostream>
2. #include<cstring>
3. #include<cmath>
4. using namespace std;
5. int lenth(char a,char b)
6. {
7. int t;
8. t=abs(a-b);
9. if(t>=13)
10. return 26-t;
11. else
12. return t;
13. }
14. int main()
15. {
16. char a[500],b[10]="a",d[500];
17. int i;
18. while(cin>>a)
19. {
20. int t,sum=0,t1;
21. strcpy(d,strcat(b,a));
22. for(i=0;i<strlen(d)-1;i++)
23. {
24. sum+=lenth(d[i],d[i+1]);
25. }
26. cout<<sum<<endl;
27. }
28. }