hdoj2055An easy problem
来源:互联网 发布:中国高铁功臣 知乎 编辑:程序博客网 时间:2024/06/16 01:00
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
刚开始循环进行到一半就停止了,后来在每个scanf后加个getchar();然后就AC了,不知道为什么,求大神指点
AC代码如下:
#include<stdio.h>int main(){int n;scanf("%d",&n);getchar();while(n--){int y;char x;scanf("%c",&x);getchar();scanf("%d",&y);getchar();if(x>=65&&x<=90)printf("%d\n",x-'A'+1+y);else if(x>=97&&x<=122)printf("%d\n",(x-'a'+1)*(-1)+y);}}
0 0
- hdoj2055An easy problem
- hdoj2055An easy problem
- easy problem
- SetType,a easy problem
- An Easy Problem
- 2055 An easy problem
- An Easy Problem!
- An Easy Problem!
- Easy Problem(cdOJ1644)
- 【模拟】Another Easy Problem
- FZU_1753 Another Easy Problem
- fzu1753 Another Easy Problem
- poj2826 An Easy Problem?!
- A problem is easy
- 三分法Easy Problem
- HDOJ2055 An easy problem
- 23:Easy problem
- An Easy Problem
- 用C语言实现栈的链式存储
- 嵌入式Linux根文件系统构建
- IO的操作
- 第六届acm河南省赛——Adjacent Bit Counts
- 连续奇数和
- hdoj2055An easy problem
- wordpress中wpdb操作数据库方法实例
- 依赖、关联、聚合、组合、继承、实现
- android getWidth/getMeasuredWidth
- singleTask
- c++单例模式
- iOS项目中Info.plist文件是干什么的?
- Executor框架和线程池
- 一篇关于ardupilot历史的文章