hdu

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<stdio.h>#include<iostream>#include<string.h>using namespace std;int main(){    int a[27]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26};    int b[27]={1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26};    int n;    cin>>n;    while(n--){        char letter;        int number;        cin>>letter>>number;        if((letter>='A')&&(letter<='Z'))           cout<<a[letter-'A']+number<<endl;        else           cout<<-1*b[letter-'a']+number<<endl;               }        return 0;}