hdoj.2055 An easy problem 20140729
来源:互联网 发布:react.js控制 隐藏div 编辑:程序博客网 时间:2024/05/21 11:22
An easy problem
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 13621 Accepted Submission(s): 9195
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>#include<ctype.h>int main(){ int n,m,y; char x; scanf("%d%*c",&n); while(n--){ scanf("%c%d%*c",&x,&y); if(isupper(x)==1) m=x-64+y; else m=96-x+y; printf("%d\n",m); } return 0;}
0 0
- hdoj.2055 An easy problem 20140729
- An easy problem hdoj 2055
- HDOJ 2055 An easy problem
- HDOJ 2055 An easy problem
- HDOJ 2055 An easy problem
- hdoj 2055 An easy problem
- HDOJ 2055 An easy problem
- hdoj-2055-An easy problem
- HDOJ 2055 An easy problem
- hdoj An easy problem
- hdoj 2055 An easy problem(新知识%*c)
- hdoj 2601 An easy problem
- HDOJ-【2601 An easy problem】
- HDOJ 2132 An easy problem
- hdoj 2055 An easy problem (单个字符)
- 2055 An easy problem
- 2055 An easy problem
- An easy DP problem HDOJ 1176
- lazy懒加载(延迟加载)UITableView
- Java中static、final用法小结
- 杭电ACM 素数判定
- Light OJ 1132 Summing up Powers 矩阵快速幂
- How Tomcat work 之第十五章之Digester
- hdoj.2055 An easy problem 20140729
- centos6.4 升级python27引发的一系列问题以及解决方案
- python 字符
- 分支-14. 简单计算器
- Oracle 11g 学习一:初始Orcale
- hdoj.2056 Rectangles 20140729
- 俺不是标题党,只想写下自己的一些体会。
- 判断整数序列是不是二元查找树的后序遍历结果
- [学习小结]Ajax_使用 XMLHttpRequest 实现 Ajax