• <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
            18禁黄久久久AAA片| 国产精品嫩草影院久久| 欧美亚洲国产精品久久| 亚洲AV日韩精品久久久久久久| 亚洲精品无码成人片久久| 久久久久综合网久久| 亚洲国产成人精品无码久久久久久综合| 国产 亚洲 欧美 另类 久久| 无码乱码观看精品久久| 久久91亚洲人成电影网站| 中文字幕精品久久久久人妻| 国产成人无码久久久精品一| 人人狠狠综合久久亚洲| 成人国内精品久久久久影院| 久久久久久精品免费看SSS| 欧美激情精品久久久久| 欧美熟妇另类久久久久久不卡 | 少妇人妻88久久中文字幕| 香蕉久久一区二区不卡无毒影院 | 亚洲国产精品久久久久婷婷老年| 久久青青草原精品国产不卡| 老色鬼久久亚洲AV综合| 久久乐国产综合亚洲精品| 成人a毛片久久免费播放| 国产人久久人人人人爽| 久久夜色精品国产欧美乱| 欧美一区二区久久精品| 久久人妻少妇嫩草AV蜜桃| 久久国产成人午夜aⅴ影院 | 久久99精品国产自在现线小黄鸭 | 久久久黄色大片| 精品综合久久久久久98| 三级片免费观看久久| 久久久精品波多野结衣| 久久久精品国产亚洲成人满18免费网站| 国内精品久久久久影院优| 国产精品久久久久久搜索| 成人妇女免费播放久久久| 1000部精品久久久久久久久| 久久精品无码专区免费青青 | 国内精品久久久久伊人av|