POJ 3094 Quicksum

最新推荐文章于 2022-05-25 19:57:33 发布

原创最新推荐文章于 2022-05-25 19:57:33 发布 · 666 阅读

0 ·

CC 4.0 BY-SA版权

POJ&&ZOJ 专栏收录该内容

33 篇文章

订阅专栏

本文介绍了一种名为Quicksum的校验和算法，该算法通过计算数据包中每个字符的位置乘以其对应值来生成校验和，用于检测数据传输错误等。文章提供了具体的计算示例，并给出了解决方案和实现代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Quicksum

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 14417		Accepted: 10050

Description

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.

Sample Input

ACM
MID CENTRAL
REGIONAL PROGRAMMING CONTEST
ACN
A C M
ABC
BBC
#

Sample Output

Source

Mid-Central USA 2006

解题思路：

这道题很水，注意输入的时候用到gets()就好了，因为如果用ｃｉｎ或者ｓｃａｎｆ输入的话，会产生一个很ＳＢ的问题，就是在处理＂　＂的时候，会被当做是第二次输入，但用ｇｅｔｓ（）就能好的避免这个问题，避免这个问题后，就是对于ｓｕｍ的维护了，不说了很水，把字母转化成数字的时候记住Ａ的ＡＳＣＩＩ为６５就好了．．．

代码：

# include<cstdio>
# include<iostream>
# include<cstring>

using namespace std;

# define MAX 256

char s[MAX];

char s1[123];
int main(void)
{
    char ch;
    int len;
    while( gets(s) )
    {
        int sum = 0;
        if ( s[0] == '#' )
            break;

        int len = strlen(s);

        for ( int i = 0;i < len;i++ )
        {
            if ( s[i] == ' ' )
                    continue;
                else
                    {
                    sum += (i+1)*( s[i] - 65 + 1 );
                    //cout<<sum<<endl;
                    }
        }
        cout<<sum<<endl;


    }




    return 0;
}