HDU 2055 An easy problem
来源:互联网 发布:2000年人口普查数据 编辑:程序博客网 时间:2024/04/19 19:13
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).
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>int main(){int n,b;char a;while(scanf("%d",&n)!=EOF){while(n--){getchar();scanf("%c%d",&a,&b);if(a>='a'&&a<='z')printf("%d\n",-(a-'a'+1)+b);elseprintf("%d\n",a-'A'+1+b);}}return 0;}
0 0
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- hdu-2055-An easy problem
- HDU 2055 An easy problem
- hdu 2055 An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem
- hdu 2055 An easy problem
- HDU-2055( An easy problem )
- hdu 2055 An easy problem
- hdu 2055 An easy problem
- Android WebView开发问题及优化汇总
- Linux下压缩某个文件夹(文件夹打包)
- Android中实现并发性联网和数据访问
- uva 11582 Colossal Fibonacci Numbers!
- linux (cent系 snmp)配置
- HDU 2055 An easy problem
- mysql编译安装与配置
- 最简单的cxf3.1的helloword入门例子
- 剖析微商到微伤的全过程
- POJ之路6--1005,6
- 第十三周 阅读程序 运用抽象类后的修改(3)
- BZOJ 4073 Wf2014 Buffed Buffet 斜率优化
- 性能优化的三个层次
- java okhttp 网络请求