Quicksum

不念不忘少年蓝@ 2022-08-10 04:44 7阅读 0赞

## Quicksum ##

##### Time Limit: 1000ms Memory limit: 65536K 有疑问？点这里^\_^ #####

## 题目描述 ##

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

## 输入 ##

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.

## 输出 ##

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

## 示例输入 ##

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

## 示例输出 ##

46
    650
    4690
    49
    75
    14
    15

## 提示 ##

[poj3094][]

有链接提示的题目请先去链接处提交程序，AC后提交到SDUTOJ中，以便查询存档。

## 来源 ##

面向对数据结构和算法不太了解的同学

## 示例程序 ##

#include<stdio.h>  
    #include<string.h>  
    int main()  
    {  
        int i,j,n,m;  
        char a[300];  
        while(gets(a)&&a[0]!='#')  
        {  
            m=0;  
           n=strlen(a);  
              for(i=0;i<n;i++)  
              {  
                  if(a[i]!=' ')  
                  m+=(a[i]-64)*(i+1);  
              }  
              printf("%d\n",m);  
              }  
    }

[poj3094]: http://acm.pku.edu.cn/JudgeOnline/problem?id=3094

Quicksum

发表评论取消回复

还没有评论，来说两句吧...

相关阅读

相关 NYOJ 173 Quicksum

相关 Quicksum