hdoj 2055 An easy problem （单个字符）

An easy problem

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 20138    Accepted Submission(s): 13391

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

6R 1P 2G 3r 1p 2g 3

 

Sample Output

191810-17-14-4

 

#include <cstdio>int main(){char x;int t,n,s;scanf("%d",&t);getchar();while(t--){scanf("%c %d",&x,&n);getchar();if(x>='a'&&x<='z')s=n-(x-'a'+1);if(x>='A'&&x<='Z')s=n+(x-'A'+1);printf("%d\n",s);}return 0;}