HDU 2055 An easy problem

An easy problem

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

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 a[200];

int main(){
	int n,i = 1,j = -1,m;
	char ch = 'A',k = 'a';
	
	while(ch <= 'Z'){
		a[ch ++] = i ++;
		a[k ++] = j --;
	}
	
	scanf("%d",&n);
	
	while(n --){
		getchar();
		scanf("%c%d",&ch,&m);

		printf("%d\n",a[ch] + m);
	}
	
	return 0;
}