C++ hdu 2055 An easy problem
来源:互联网 发布:最好的seo课程 编辑:程序博客网 时间:2024/05/20 20:21
#include<iostream>using namespace std;int main(){ int n,y; char x; cin >> n; while (n--) { cin >> x >> y; if (x>='A'&&x<='Z') { cout << y + (x - 'A' + 1)<<endl; } if(x>='a'&&x<='z') { cout << y - (x - 'a' + 1)<<endl; } } 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
- BestCoder Round #88
- java-hibernate框架介绍1
- 位、字节和字
- 我回来了
- php设计模式(工厂模式)
- C++ hdu 2055 An easy problem
- JSON学习入门
- 【C++研发面试笔记】3. 命名空间与内存管理
- 进入OS前的两步之PendSV(任务切换)
- OpenCL笔记
- Linux - C数据库编程(预习内容四)
- 嵌入式系统学习(九)-用过内核驱动操作GPIO
- Struts2 formBean传值
- map应用:反片语