• <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 閱讀(724) 評論(0)  編輯 收藏 引用 所屬分類: 字符串HDU
            久久无码国产专区精品| 久久精品嫩草影院| 精品人妻伦九区久久AAA片69| 久久亚洲国产中v天仙www| 久久www免费人成看国产片| 欧美久久久久久午夜精品| 国产精品久久久久jk制服| 色综合久久综合网观看| 亚洲国产精品无码久久久久久曰 | 久久精品嫩草影院| 久久久久女教师免费一区| 久久夜色精品国产噜噜亚洲AV| 国产精品免费久久久久影院| 久久精品国产精品亚洲毛片| 久久久国产亚洲精品| 久久99精品久久久久久噜噜| 午夜精品久久久久久久久| 香蕉久久影院| 久久精品男人影院| 波多野结衣AV无码久久一区| 精品国产乱码久久久久软件| 无码国内精品久久综合88| 18岁日韩内射颜射午夜久久成人| 久久久久亚洲AV无码永不| 一本久久综合亚洲鲁鲁五月天亚洲欧美一区二区 | 99久久超碰中文字幕伊人| 久久国产精品无| 日本精品一区二区久久久| 色综合久久中文色婷婷| 青青草国产精品久久久久| 99久久久国产精品免费无卡顿| 伊人久久综合精品无码AV专区| 久久精品免费网站网| 51久久夜色精品国产| 久久免费国产精品一区二区| 久久精品无码一区二区无码| 久久SE精品一区二区| 国产成人精品综合久久久久 | 综合久久一区二区三区 | 久久996热精品xxxx| 久久AAAA片一区二区|