zoukankan      html  css  js  c++  java
  • HDU------checksum

    Quicksum

    Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
    Total Submission(s): 3401 Accepted Submission(s): 2095
     
    Problem 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 = 46MID 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
     
    Recommend
    teddy
     
     1 #include <string.h>
     2 #include <stdio.h>
     3 
     4 int main()
     5 {
     6     char str[10000];
     7     int len,i,a[26],sum;
     8     for(i = 0;i<26;i++)
     9     {
    10         a[i] = i+1;
    11     }
    12     while(gets(str))
    13     {
    14         if(strcmp(str,"#") == 0)
    15         break;
    16         len = strlen(str);
    17         sum = 0;
    18         for(i = 0;i<len;i++)
    19         {
    20             if(str[i]>='A' && str[i]<='Z')
    21             sum+=(i+1)*a[str[i]-'A'];
    22         }
    23         printf("%d
    ",sum);
    24     }
    25 
    26     return 0;
    27 }
  • 相关阅读:
    使用递归实现字符串的反转
    .NetCore利用BlockingCollection实现简易消息队列
    .Net Core WebApi控制器接收原始请求正文内容
    反思
    重新解读DDD领域驱动设计(一)
    《实现领域驱动设计》笔记(1)-开卷有益总览
    我来悟微服务(3)-需求管理
    我来悟微服务(2)-惊魂一刻
    Bing.com在.NET Core 2.1上运行!
    Window下mysql环境配置问题整理
  • 原文地址:https://www.cnblogs.com/MICE1024/p/5775603.html
Copyright © 2011-2022 走看看