we define f(A) = 1, f(a) = -1, f(B) = 2, f(b) = -2, ... f(Z) = 26, f(z) = -26;
Give you a letter x and a number y , you should output the result of y+f(x).
InputOn the first line, contains a number T.then T lines follow, each line is a case.each case contains a letter and a number.Outputfor each case, you should the result of y+f(x) on a line.Sample Input
6
R 1
P 2
G 3
r 1
p 2
g 3
Sample Output
19
18
10
-17
-14
-4
#include<iostream>
using namespace std;
int main()
{
int a,i,n,j;
char b;
cin>>n;
for(i=1;i<=n;i++)
{ cin>>b>>a;
if('a'<=b&&b<='z')
j=-(b-'a'+1);
if('A'<=b&&b<='Z')
j=b-'A'+1;
cout<<a+j<<endl;
}
}
题解:讲字母转换成数字:y=x-'a'+1。
本文介绍了一种将字母转换为特定数字的算法,并提供了一个C++实现案例。该算法通过给定的映射规则,将输入的字母转换为相应的正负整数,再与输入的数字相加得到结果。
398

被折叠的 条评论
为什么被折叠?



