Quicksum


Time Limit: 2 Seconds      Memory Limit: 65536 KB

A checksum is an algorithm that scans a packet of data and returns a single number. The idea is that if the packet is changed, the checksum will also change, so checksums are often used for detecting transmission errors, validating document contents, and in many other situations where it is necessary to detect undesirable changes in data.

For this problem, you will implement a checksum algorithm called Quicksum. A Quicksum packet allows only uppercase letters and spaces. It always begins and ends with an uppercase letter. Otherwise, spaces and letters can occur in any combination, including consecutive spaces.

A Quicksum is the sum of the products of each character's position in the packet times the character's value. A space has a value of zero, while letters have a value equal to their position in the alphabet. So, A=1, B=2, etc., through Z=26. Here are example Quicksum calculations for the packets "ACM" and "MID CENTRAL":

        ACM: 1*1  + 2*3 + 3*13 = 46

MID CENTRAL: 1*13 + 2*9 + 3*4 + 4*0 + 5*3 + 6*5 + 7*14 + 8*20 + 9*18 + 10*1 + 11*12 = 650

Input: The input consists of one or more packets followed by a line containing only # that signals the end of the input. Each packet is on a line by itself, does not begin or end with a space, and contains from 1 to 255 characters.

Output: For each packet, output its Quicksum on a separate line in the output.

#include <iostream>
#include <string>
using namespace std;
int main(){
string s;
while(getline(cin, s)){
if(s[] == '#'){
break;
}
int l = s.length(), sum = ;
for(int i = ; i < l; i++){
if(s[i] != ' '){
int t = (int)(s[i] - 'A') + ;
sum += (i + ) * t;
//cout << t << " ";
}
}
cout << sum << endl;
}
return ;
}
 #include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream cin("aaa.txt");
char ch;
int i = ;
int sum = ;
//cin会忽略回车、空格、Tab跳格
//采用cin.get()一个一个读,就不会忽略任何字符
//也可采用cin.getline()一行一行读入
while(cin.get(ch)){
if(ch == '#') break;
if(ch != '\n'){
if(ch != ' ')
sum += i * (ch - );
i++;
}
if(ch == '\n'){
cout << sum << endl;
sum = ;
i = ;
}
}
return ;
}
 #include <iostream>
#include <fstream>
using namespace std;
int main(){
ifstream cin("aaa.txt");
char ch[];
int sum;
while(cin.getline(ch, )){
sum = ;
if(ch[] == '#')
break;
for(int i = ; ch[i] != '\0'; i++){
if(ch[i] != ' ')
sum += (i + ) * (ch[i] - );
}
cout << sum << endl;
}
return ;
}
Example Input: Example Output:
ACM
MID CENTRAL
REGIONAL PROGRAMMING CONTEST
ACN
A C M
ABC
BBC
#
46
650
4690
49
75
14
15

最新文章

  1. 第二天 ado.net, asp.net ,三层笔记
  2. 两种流行Spring定时器配置:Java的Timer类和OpenSymphony的Quartz
  3. HTTP Cookie/Session
  4. C#中的可空类型
  5. JavaScript之canvas
  6. CXF之七 传输文件
  7. MongoDB使用记录
  8. 数据结构(主席树):HDU 5654 xiaoxin and his watermelon candy
  9. 【SQL】大杂烩
  10. Ubuntu 14.04 apt源更新
  11. Student s = new Student();在内存中做了哪些事情?
  12. 浅谈lvs和nginx的一些优点和缺点
  13. label联动checkbox
  14. spark RDD,DataFrame,DataSet 介绍
  15. mac搭建简单的hls推流服务器遇到的问题(待更新)
  16. 【Vue】谈Vue的依赖追踪系统 ——搞懂methods watch和compute的区别和联系
  17. golang 常量的用法
  18. 基础图像处理之混合空间增强——(Java:拉普拉斯锐化、Sobel边缘检测、均值滤波、伽马变换)
  19. c语言数字图像处理(八):噪声模型及均值滤波器
  20. 在eclipse中,用maven创建web项目

热门文章

  1. linux查找命令(find)
  2. normal曲线绘制
  3. 160 Intersection of Two Linked Lists 相交链表
  4. MySQL5.5升级到5.6
  5. Docker DOC
  6. JS进阶-特殊形式的函数-返回函数的函数/重写自己的函数
  7. Android学习笔记(十六) ContentProvider
  8. Java URL 中文乱码解决办法
  9. Redis学习笔记(四)集合进阶
  10. Photoshop 注册破解