An easy problem

Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 20749    Accepted Submission(s): 13805 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   Author 8600 水题 #include <stdio.h> int main() { char tmp; int t,n; while(~scanf("%d",&t)) { getchar(); while(t--) { scanf("%c%d",&tmp,&n); if(tmp>='A'&&tmp<='Z') printf("%d\n",tmp-64+n); else printf("%d\n",96-tmp+n); getchar(); } } return 0; }