zoukankan      html  css  js  c++  java
  • Quicksum

    Quicksum

    Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other)
    Total Submission(s) : 102   Accepted Submission(s) : 33
    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
     
     1 #include <stdio.h>
     2 #include <stdlib.h>
     3 #include <string.h>
     4 #define N 10000
     5 
     6 int main()
     7 {
     8     long long n,L,i,sum;
     9     char a[N];
    10     while(1)
    11     {
    12         gets(a);
    13         L=strlen(a);
    14         if(L==1&&a[0]=='#')
    15             break;
    16         for(i=0,sum=0;i<L;i++)
    17         {
    18            if(a[i]==32)
    19                 continue;
    20             sum+=((a[i]-64)*(i+1));
    21 
    22         }
    23         printf("%lld
    ",sum);
    24     }
    25 }
    View Code
    转载请备注:
    **************************************
    * 作者: Wurq
    * 博客: https://www.cnblogs.com/Wurq/
    * Gitee: https://gitee.com/wurq
    **************************************
  • 相关阅读:
    【ICLR2018】Mixup 解读
    MobileNetV2 解读
    MobileNetV1 解读
    AdaIN 解读
    心灵奇旅
    SA-Net: Shuffle Attention for Deep Convolutional Neural Networks
    ShuffleNet V1 解读
    情人节看《唐探3》
    拆弹人
    内卷常态下的就业烦恼
  • 原文地址:https://www.cnblogs.com/Wurq/p/3750215.html
Copyright © 2011-2022 走看看