An easy problem

An easy problem

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

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>
#include <stdlib.h>

int main()
{
  int n,y,sum;
  char str;
  scanf("%d",&n);
  while(n--)
  {  
    getchar();
    scanf("%c %d",&str,&y);
    if(str>='A'&&str<='Z')
      sum=str-64+y;
    if(str>='a'&&str<='z')
      sum=-1*(str-96)+y;
    printf("%d\n",sum);
  }
  system("pause");
  return 0;
} 

  
  
  
  

   
   

  
  
  
  

   
   

  
  
  
  

   
   源代码二：
  
  
  
  

   
   #include <stdio.h>
#include <stdlib.h>

int main()
{
  int n,y,i,sum;
  char a[1];
  while(scanf("%d",&n)!=EOF)
  {
    while(n--)
    { 
      scanf("%s %d",&a[0],&y);
      i=(int)a[0];
      if(i>64&&i<91)
        sum=i+y-64;
      if(i>96&&i<123)
        sum=-1*(i-96)+y;
      printf("%d\n",sum);
    }
  }
  system("pause");
  return 0;
}