hdu2055

An easy problem

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

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
  
  
  
  

   
    
  
  
  
  

   
   #代码#：
  
  
  
  

   
   #include<stdio.h>
int main()
{
 int t,y;
 char c[2];
 scanf("%d",&t);
 while(t--)
 {
  scanf("%s %d",&c,&y);
  if(c[0]-'a'>=0)
   printf("%d\n",y-(c[0]-'a')-1);
  else
   printf("%d\n",y+(c[0]-'A')+1);
 }
 return 0;
}