• <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
            亚洲午夜久久久影院| 99久久精品国产一区二区| 亚洲国产精品无码久久久久久曰 | 国产ww久久久久久久久久| 久久美女网站免费| 久久露脸国产精品| 精品久久久久久久久中文字幕| 久久久久久国产精品美女| 免费精品国产日韩热久久| 久久久噜噜噜www成人网| 日本精品久久久久影院日本| 少妇内射兰兰久久| 亚洲国产婷婷香蕉久久久久久| 亚洲人成网站999久久久综合 | 国产高潮国产高潮久久久91| 欧美色综合久久久久久| 国产美女久久精品香蕉69| 亚洲天堂久久久| 国产精品99久久精品| 亚洲午夜无码久久久久| 久久只这里是精品66| 国产免费福利体检区久久| 久久夜色精品国产噜噜亚洲AV | 区久久AAA片69亚洲| 久久免费美女视频| 久久九九精品99国产精品| 人妻精品久久久久中文字幕| 久久777国产线看观看精品| 久久婷婷五月综合色高清| 五月丁香综合激情六月久久| 久久久久99这里有精品10| 久久中文字幕精品| 久久久一本精品99久久精品88| 久久综合久久性久99毛片| 国产ww久久久久久久久久| 国产精品久久久久一区二区三区| 亚洲级αV无码毛片久久精品| 国产精品久久久久a影院| 国内精品久久久久久中文字幕| 大香网伊人久久综合网2020| 99久久国产免费福利|