题目链接:http://ac.jobdu.com/problem.php?pid=1079
详解链接:https://github.com/zpfbuaa/JobduInCPlusPlus
参考代码:
// // 1079 手机键盘.cpp // Jobdu // // Created by PengFei_Zheng on 03/05/2017. // Copyright © 2017 PengFei_Zheng. All rights reserved. // #include <stdio.h> #include <iostream> #include <algorithm> #include <string.h> #include <cstring> #include <cmath> #include <climits> #define MAX_SIZE 110 using namespace std; char str[MAX_SIZE]; int pos[26]={2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,7,7,7,8,8,8,9,9,9,9}; int kase[26]={1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,1,2,3,4,1,2,3,1,2,3,4}; int main(){ while(scanf("%s",str)!=EOF){ int len = (int)strlen(str); int sum = kase[str[0]-‘a‘]; for(int i = 1 ; i < len ; i++){ if(pos[str[i]-‘a‘]!=pos[str[i-1]-‘a‘]){ sum+=(kase[str[i]-‘a‘]); } else { sum+=2+kase[str[i]-‘a‘]; } } printf("%d\n",sum); } return 0; } /************************************************************** Problem: 1079 User: zpfbuaa Language: C++ Result: Accepted Time:10 ms Memory:1520 kb ****************************************************************/
时间: 2024-10-21 03:55:26