hdu 2055 An easy problem

链接：http://hdu.hustoj.com/showproblem.php?pid=2055

An easy problem

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

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
  
  

如题，so easy 的题，放上来是为了提醒自己在处理字符的时候注意回车

代码：

#define _CRT_SBCURE_MO_DEPRECATE    
#include<iostream>    
#include<stdlib.h>    
#include<stdio.h>    
using namespace std;

int n;
char c;
int k;
int fun(char c) {
	if (c >= 65 && c <= 90) return (c - 64);
	else if (c >= 97 && c <= 122) return -(c - 96);
}

int main()
{
	while (scanf("%d", &n) != EOF) {
		getchar();
		while (n--) {
			scanf("%c %d", &c, &k);
			getchar();
			k += fun(c);
			printf("%d\n", k);
		}
	}
	//system("pause");
	return 0;
}