Hdu2055 An easy problem
2017-06-12 08:33
477 查看
#include <iostream>
using namespace std;
int f(char mm)
{
if(mm>='a'&&mm<='z'){
return 0-(mm-96);
}
else if(mm>='A'&&mm<='Z'){
return mm-64;
}
}
int main()
{
int n;
cin>>n;
while(n--){
char a;
int b;
cin>>a>>b;
cout<<f(a)+b<<endl;
}
return 0;
}
using namespace std;
int f(char mm)
{
if(mm>='a'&&mm<='z'){
return 0-(mm-96);
}
else if(mm>='A'&&mm<='Z'){
return mm-64;
}
}
int main()
{
int n;
cin>>n;
while(n--){
char a;
int b;
cin>>a>>b;
cout<<f(a)+b<<endl;
}
return 0;
}
相关文章推荐
- hdu2055 An easy problem
- hdu2055 An easy problem(C语言)
- HDU2055_An easy problem
- HDU2055_An easy problem
- HDU2055 An easy problem【水题】
- hdu2055 An easy problem
- POJ_2453_An Easy Problem(位运算神代码)
- 2015 ACM/ICPC Asia Regional Shanghai Online An easy problem(简单题)
- HDU 5475:An easy problem 这题也能用线段树做???
- hdu 5475 An easy problem(线段树)
- UVa 10093 - An Easy Problem!
- ACM学习历程—HDU5475 An easy problem(线段树)(2015上海网赛08题)
- HDU 2132 An easy problem
- An Easy Problem Of BFS(queue stack)
- poj 2826 An Easy Problem?! (线段相交问题终极版...并不easy)
- QUT——An Easy Math Problem (三次函数求最大值)
- poj 2826 An Easy Problem?!(线段相交、模拟)
- An Easy Problem?! POJ - 2826
- UESTC - 1597 An easy problem C (线段树)
- poj2453 an easy problem (位运算)