您的位置:首页 > 其它

九度OJ 1079 清华真题——字符串处理之《手机键盘》

2013-02-21 09:42 435 查看
题目地址:http://ac.jobdu.com/problem.php?pid=1079

//九度OJ 1079 字符串处理之《手机键盘》
//http://ac.jobdu.com/problem.php?pid=1079
#include<stdio.h>
#include<string.h>
#define MAXS 102
int main()
{
int i,n,l,flag,count;
char h[MAXS];
while(~scanf("%s",h))
{
flag=count=0;//count计时间。flag记录此字符上面那个字符所在的按键。
l=strlen(h);
for(i=0;i<l;i++)
{
switch(h[i])
{
case 'a':count++;
if(flag==2)count+=2;
flag=2;break;
case 'b':count+=2;
if(flag==2)count+=2;
flag=2;break;
case 'c':count+=3;
if(flag==2)count+=2;
flag=2;break;
case 'd':count++;
if(flag==3)count+=2;
flag=3;break;
case 'e':count+=2;
if(flag==3)count+=2;
flag=3;break;
case 'f':count+=3;
if(flag==3)count+=2;
flag=3;break;
case 'g':count++;
if(flag==4)count+=2;
flag=4;break;
case 'h':count+=2;
if(flag==4)count+=2;
flag=4;break;
case 'i':count+=3;
if(flag==4)count+=2;
flag=4;break;
case 'j':count++;
if(flag==5)count+=2;
flag=5;break;
case 'k':count+=2;
if(flag==5)count+=2;
flag=5;break;
case 'l':count+=3;
if(flag==5)count+=2;
flag=5;break;
case 'm':count++;
if(flag==6)count+=2;
flag=6;break;
case 'n':count+=2;
if(flag==6)count+=2;
flag=6;break;
case 'o':count+=3;
if(flag==6)count+=2;
flag=6;break;
case 'p':count++;
if(flag==7)count+=2;
flag=7;break;
case 'q':count+=2;
if(flag==7)count+=2;
flag=7;break;
case 'r':count+=3;
if(flag==7)count+=2;
flag=7;break;
case 's':count+=4;
if(flag==7)count+=2;
flag=7;break;
case 't':count++;
if(flag==8)count+=2;
flag=8;break;
case 'u':count+=2;
if(flag==8)count+=2;
flag=8;break;
case 'v':count+=3;
if(flag==8)count+=2;
flag=8;break;
default :count+=h[i]-'w'+1;
if(flag==9)count+=2;
flag=9;
}
}
printf("%d\n",count);
}
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: