杭电oj An easy problem
来源:互联网 发布:宁波大数据培训 编辑:程序博客网 时间:2024/05/22 01:39
</pre><h1 style="color: rgb(26, 92, 200);">An easy problem</h1><strong><span style="color: green; font-family: Arial;">Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 14028 Accepted Submission(s): 9462</span></strong><div align="left" class="panel_title">Problem Description</div><div class="panel_content">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).</div><div class="panel_bottom"> </div><div align="left" class="panel_title">Input</div><div class="panel_content">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.</div><div class="panel_bottom"> </div><div align="left" class="panel_title">Output</div><div class="panel_content">for each case, you should the result of y+f(x) on a line.</div><div class="panel_bottom"> </div><div align="left" class="panel_title">Sample Input</div><div class="panel_content"><pre><div style="font-family: Courier New,Courier,monospace;">6R 1P 2G 3r 1p 2g 3</div>
Sample Output
191810-17-14-4
Author
8600
Source
校庆杯Warm Up
我的代码://可能不是最优。。也可能很简单。。先判断输入的字符的大写的还是小写的,然后对应的数和输入的数字相加。。
#include<iostream>#include<stdio.h>using namespace std;int main(){int T,i;char x;double y,sum;cin>>T;while(T--){cin>>x>>y;if(x>='A'&&x<='Z'){for(i=0;i<26;i++){if(x=='A'+i){sum=i+1+y; break;}}}if(x>='a'&&x<='z'){for(i=0;i<26;i++){if(x=='a'+i){sum=-i-1+y; break;}}}printf("%.0lf\n",sum);}return 0;}
0 0
- 杭电oj An easy problem
- 【杭电-oj】-2055-An easy problem
- 杭电OJ--1076 An Easy Task
- 杭电oj-1076-An Easy Task
- 杭电oj-An Easy Task
- 杭电ACM 2055 An easy problem
- 杭电 ACM 2055 An easy problem
- 杭电 2055 An easy problem
- 杭电 2055 An easy problem
- 杭电2132An easy problem
- 杭电ACM 2055:An easy problem
- 杭电2055—An easy problem
- 【杭电】[2055]An easy problem
- hdu-oj 2123 An easy problem
- 杭电OJ(HDU)-ACMSteps-Chapter Two-《An Easy Task》《Buildings》《decimal system》《Vowel Counting》
- 杭电2055 An easy problem(y+f(x))-----20140801
- 【NOI OJ】1455 An Easy Problem(简单模拟题)
- 杭电1076 An Easy Task
- 592- 使用的Hint 无效-续
- PAT 2-08 用扑克牌计算24点(C语言实现)
- uva1306 - The K-League 网络流
- 找工作经验之——笔试
- hdu1074 状态压缩dp+记录方案
- 杭电oj An easy problem
- Json技术使用代码示例
- 《牛腩新闻发布系统》回顾(一)
- 解决Android主线程不能访问网络
- php方法集合
- C基本知识总结
- vxWorks硬盘驱动加载分析。。。待续
- 找工作经验之——准备工作
- Node.js + Web Socket 打造即时聊天程序嗨聊