杭电OJ第11页2055~2059算法题（C语言）

2055.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 3
Sample Output
19
18
10
-17
-14
-4

分析：本题需要注意的字母与数的对应关系。

#include 

void EasyProblem(){
	int x,n,res;
	char y;
	scanf("%d",&n);
	while(n--){
		getchar();
		scanf("%c%d",&y,&x);
		if(y>='A' && yx2) swap(&x1,&x2);
		if(y1>y2) swap(&y1,&y2);
		if(x3>x4) swap(&x3,&x4);
		if(y3>y4) swap(&y3,&y4);
		//相离
		if(x3>=x2 || y3>=y2 || x4