• <ins id="pjuwb"></ins>
    <blockquote id="pjuwb"><pre id="pjuwb"></pre></blockquote>
    <noscript id="pjuwb"></noscript>
          <sup id="pjuwb"><pre id="pjuwb"></pre></sup>
            <dd id="pjuwb"></dd>
            <abbr id="pjuwb"></abbr>

            Quicksum

            Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
            Total Submission(s): 492    Accepted Submission(s): 408

            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


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

            int main()
            {
                
            char str[260];
                
            int ans = 0;
                
            while( gets(str) && str[0!= '#' )
                
            {
                    ans 
            = 0;
                    
            int len = strlen(str);
                    
            forint i = 0; i < len; i++ )
                    
            {
                        
            if( str[i] == ' ' )
                            
            continue;
                        
            else
                            ans 
            += ( str[i] - 64 ) * ( i + 1 );
                    }

                    std::cout 
            << ans << std::endl;
                }

                
            return 0;
            }


            posted on 2010-10-03 10:03 Vontroy 閱讀(720) 評論(0)  編輯 收藏 引用 所屬分類: 字符串HDU
            久久水蜜桃亚洲av无码精品麻豆 | 久久久久综合网久久| 久久综合狠狠综合久久综合88| 色偷偷偷久久伊人大杳蕉| 国产情侣久久久久aⅴ免费| 国产成人99久久亚洲综合精品| 国内精品久久久久久久亚洲| 国产精品久久久久久久久久影院| 精品熟女少妇a∨免费久久| 精品久久久久久无码人妻蜜桃| 综合久久久久久中文字幕亚洲国产国产综合一区首 | 久久久久久国产精品免费免费| 伊人久久综合成人网| 国产精品成人无码久久久久久 | 国产精品天天影视久久综合网| 色播久久人人爽人人爽人人片aV | 91精品国产色综久久| 偷窥少妇久久久久久久久| 9999国产精品欧美久久久久久| 亚洲а∨天堂久久精品| 亚洲国产成人久久精品动漫| 色婷婷综合久久久中文字幕| 日本加勒比久久精品| 很黄很污的网站久久mimi色 | 无码8090精品久久一区| 91精品国产91热久久久久福利 | 四虎国产精品成人免费久久| 久久精品国产精品青草app| 一本色道久久综合亚洲精品| 亚洲欧美一级久久精品| 伊人久久综在合线亚洲2019 | 9999国产精品欧美久久久久久| 久久国产热精品波多野结衣AV| 亚洲国产一成人久久精品| 久久久久久综合网天天| 久久久精品国产免大香伊| 久久久久久综合网天天| 无码国内精品久久人妻蜜桃 | 亚洲午夜久久久影院| 人妻无码中文久久久久专区| 99久久国产综合精品女同图片|