zoukankan      html  css  js  c++  java
  • poj3094

    Quicksum
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 13523   Accepted: 9407

    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

    46
    650
    4690
    49
    75
    14
    15

    Source

    Mid-Central USA 2006
     1 #include <iostream>
     2 #include <cstring>
     3 #include<cstdio>
     4 using namespace std;
     5 
     6 int main()
     7 {
     8     char str[256];
     9     char rule[27]={'A','B','C','D','E','F','G','H','I','J','K','L','M',
    10     'N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
    11     while(gets(str))
    12     {
    13         if(str[0]=='#')
    14             break;
    15         int len = strlen(str);
    16         int sum = 0;
    17         for(int i = 0;i<len;i++)
    18         {
    19             if(str[i]==' ')
    20                 continue;
    21             for(int j = 0;j<26;j++)
    22             {
    23                 if(str[i]==rule[j])
    24                 {
    25                     sum =sum +(i+1)*(j+1);
    26                     break;
    27                 }
    28             }
    29         }
    30         cout<<sum<<endl;
    31     }
    32     return 0;
    33 }
  • 相关阅读:
    微软解决方案框架MSF4.0的预发布版本支持敏捷过程了
    Jackson 框架,轻易转换JSON
    [ lucene扩展 ] Spelling Checker using Lucene
    [ solr扩展 ] Solr Spellchecker internals (now with tests!)
    [ lucene扩展 ] An Introduction to Apache Lucene for FullText Search
    linux中 jdk 的卸载和安装[转]
    hadoop入门之单机版环境搭建[转]
    Redhat上两台服务器建立SSH信任关系[转]
    MYSQL常用命令[转]
    linux下vi命令大全
  • 原文地址:https://www.cnblogs.com/jhldreams/p/3751910.html
Copyright © 2011-2022 走看看