hdoj-2055-An easy problem
2013-07-07 19:00
288 查看
#include<stdio.h> #include<algorithm> #include<functional> #include<string.h> using namespace std; int main() { int n,b,flag; char a; while(scanf("%d",&n)!=EOF) { while(n--) { getchar();//惹祸啊 scanf("%c%d",&a,&b); if(a>='a'&&a<='z') flag=-(a-'a'+1); else flag=(a-'A'+1); printf("%d\n",flag+b); } } return 0; }
相关文章推荐
- hdoj2055 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
- HDOJ2055_An easy problem(大数加法)
- HDOJ 2055 An easy problem
- HDOJ 2055 An easy problem
- HDOJ5475 An easy problem(暴力 & 线段树)
- An easy problem(2055)
- HDU 2055 An easy problem
- 2055——An easy problem
- HDU:2055 An easy problem
- HDOJ2123 An easy problem
- HDU 2055 An easy problem
- hdu-2055-An easy problem
- HDU 2055 An easy problem
- HDU 2055 An easy problem