CodeForces 731A 之 Night at the Museum
2016-10-24 11:34
639 查看
Description
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:
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.
Sample Input
Input
Output
Input
Output
Input
Output
Hint
To print the string from the first sample it would be optimal to perform the following sequence of rotations:
from 'a' to 'z' (1 rotation counterclockwise),
from 'z' to 'e' (5 clockwise rotations),
from 'e' to 'u' (10 rotations counterclockwise),
from 'u' to 's' (2 counterclockwise rotations).
In total, 1 + 5 + 10 + 2 = 18 rotations are required.
AC代码如下:
#include <iostream>
#include<algorithm>
#include<cmath>
#include <cstdio>
#include <cstring>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char** argv) {
char ch[110];
while(scanf("%s",ch)!=EOF)
{
int ans=0;
ans=min(abs(ch[0]-'a'),abs(26-(ch[0]-'a')));
for(int i=1;i<strlen(ch);i++)
{
ans+=min(abs(ch[i]-ch[i-1]),26-abs(ch[i]-ch[i-1]));
}
printf("%d\n",ans);
}
return 0;
}
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:
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.
Sample Input
Input
zeus
Output
18
Input
map
Output
35
Input
ares
Output
34
Hint
To print the string from the first sample it would be optimal to perform the following sequence of rotations:
from 'a' to 'z' (1 rotation counterclockwise),
from 'z' to 'e' (5 clockwise rotations),
from 'e' to 'u' (10 rotations counterclockwise),
from 'u' to 's' (2 counterclockwise rotations).
In total, 1 + 5 + 10 + 2 = 18 rotations are required.
AC代码如下:
#include <iostream>
#include<algorithm>
#include<cmath>
#include <cstdio>
#include <cstring>
using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */
int main(int argc, char** argv) {
char ch[110];
while(scanf("%s",ch)!=EOF)
{
int ans=0;
ans=min(abs(ch[0]-'a'),abs(26-(ch[0]-'a')));
for(int i=1;i<strlen(ch);i++)
{
ans+=min(abs(ch[i]-ch[i-1]),26-abs(ch[i]-ch[i-1]));
}
printf("%d\n",ans);
}
return 0;
}
相关文章推荐
- CodeForces 731A-Night at the Museum
- CodeForces 731A Night at the Museum
- codeforces 731A Night at the Museum
- CodeForces 731A Night at the Museum (水题)
- CodeForces 731A - Night at the Museum(模拟)
- 【87.65%】【codeforces 731A】Night at the Museum
- 【Codeforces Round #376 (Div. 2)】 Codeforces 731A Night at the Museum
- CodeForces 731 A.Night at the Museum(水~)
- Codeforces Round #376 (Div. 2) A. Night at the Museum
- Night at the Museum
- A. Night at the Museum
- Night at the Museum(水题)
- A - Night at the Museum
- Codeforces Round #376 (Div. 2) A. Night at the Museum(水题)
- Codeforces Round #376 (Div. 2) A. Night at the Museum
- Codeforces Round #376 (Div. 2) A. Night at the Museum —— 循环轴
- Codeforces Round #376 (Div. 2) A. Night at the Museum【模拟】
- Codeforces 599 C Day at the Beach
- 【Codeforces 723C】Polycarp at the Radio 贪心
- [贪心] Codeforces 723C #375 (Div. 2) C. Polycarp at the Radio