【Codeforces Round #376 (Div. 2)】 Codeforces 731A Night at the Museum
来源:互联网 发布:新业软件试用版 编辑:程序博客网 时间:2024/05/16 12:21
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
embosser 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. InputThe 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.
OutputPrint one integer — the minimum number of rotations of the wheel,
required to print the name given in the input.
模拟。
#include<cstdio>#include<cstring>char s[110];int abs(int x){ return x>0?x:-x;}int min(int x,int y){ return x<y?x:y;}int main(){ int i,j,k,x,y,z,n,ans=0,l,p; scanf("%s",s+1); l=strlen(s+1); p='a'; for (i=1;i<=l;i++) { ans+=min(abs(s[i]-p),26-abs(s[i]-p)); p=s[i]; } printf("%d\n",ans);}
- 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)】 Codeforces 731A 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 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 731A 之 Night at the Museum
- CodeForces 731A - Night at the Museum(模拟)
- CodeForces 731 A.Night at the Museum(水~)
- CodeForces 731A Night at the Museum(博物馆循环的单词表)
- Codeforce 731A. Night at the Museum
- A. Night at the Museum
- 常用到的导入导出oracle
- Spark常用函数讲解之Action操作
- html5 新的选择器
- HTML——jshtml学习笔记+实例+正则表达式+简单轮播+表格增删改查
- springmvc+mybatis显示正确的日期时间的方法
- 【Codeforces Round #376 (Div. 2)】 Codeforces 731A Night at the Museum
- [51Nod 1185 威佐夫游戏 V2]Wythoff Game+乘法模拟
- Spark的 DAGschedule & task schedule 区别以及相互联系
- dagger2 让你爱不释手:重点概念讲解、融合篇
- 如何成功激活win10专业版
- APIStudio中如何导入已有项目?
- 51nod 1284 2 3 5 7的倍数(容斥定理)
- PHP面向对象_自动加载类__autoload()
- caffe windows编译及配置