hdu 2055 An easy problem

An easy problem

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 

Sample Output

19

18

10

-17

-14

-4

问题链接：http://acm.hdu.edu.cn/showproblem.php?pid=2055

源代码

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <iterator>
#include <cstring>
#include <cctype>
#include <stack>

using namespace std;

int main()
{
    int n;
    cin >> n;
    while(n--)
    {
        char a;
        cin >> a;
        int y;
        cin >> y;
        int sum = 0;
        if(a >= 'a' && a <= 'z')
        {
            sum = a - 'a';
            sum++;
            sum = -sum;
        }
        else if(a >= 'A' && a <= 'Z')
        {
            sum = a - 'A';
            sum++;
        }
        sum += y;
        printf("%d\n", sum);

    }
    return 0;
}