An easy problem
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 20884 Accepted Submission(s): 13891
Problem Description
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).
Input
On the first line, contains a number T.then T lines follow, each line is a case.each case contains a letter and a number.
Output
for 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
最近心情不是很好,赶紧水一下,以稳定情绪
<span style="font-size:12px;">#include<cstdio>
#include<iostream>
using namespace std;
int main()
{
int t,f[123];
cin>>t;
for(int c=1,i='A';i<='Z';c++,i++)
{
f[i]=c;
f[i+32]=-c;
}
while(t--)
{
char x;
int y;
cin>>x>>y;
cout<<y+f[x]<<endl;
}
return 0;
} </span>