当前位置: 代码迷 >> 综合 >> NYOJ - a letter and a number
  详细解决方案

NYOJ - a letter and a number

热度:60   发布时间:2024-01-20 18:18:47.0

a letter and a number

时间限制:3000 ms | 内存限制:65535 KB
难度:1
描述
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).
输入
On the first line, contains a number T(0<T<=10000).then T lines follow, each line is a case.each case contains a letter x and a number y(0<=y<1000).
输出
for each case, you should the result of y+f(x) on a line
样例输入
6
R 1
P 2
G 3
r 1
p 2
g 3
样例输出
19
18
10
-17
-14
-4
#include <stdio.h>
int main()
{int n,y;char x;scanf("%d",&n);getchar();while(n--){scanf("%c%d",&x,&y);if(x < 'a')printf("%d\n",x-'A'+1+y);elseprintf("%d\n",'a'-x-1+y);getchar();}
}

  相关解决方案