• <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| 久久成人永久免费播放| 性做久久久久久久久浪潮| 伊人久久大香线蕉av不变影院| 久久91综合国产91久久精品| 久久精品中文字幕一区| 无码专区久久综合久中文字幕 | 精品久久久无码21p发布| 无码精品久久久天天影视 | 国内精品久久久久久不卡影院| 久久无码人妻精品一区二区三区 | 伊人久久大香线蕉精品不卡| 日韩精品久久无码中文字幕| 精品久久人人爽天天玩人人妻| 亚洲国产精品无码久久久蜜芽| 99久久精品这里只有精品| 久久久久久久久久久久久久 | 青青草原综合久久大伊人| 国产精品美女久久久免费| 精品少妇人妻av无码久久| 狠狠色噜噜色狠狠狠综合久久| 九九久久精品无码专区| 久久婷婷五月综合97色一本一本| 人妻系列无码专区久久五月天| 色综合久久88色综合天天| 国内精品久久久久久99蜜桃| 中文字幕热久久久久久久| 久久伊人精品一区二区三区| 性高湖久久久久久久久AAAAA| 精品久久久久久无码中文字幕| 国产综合久久久久久鬼色| 久久国产乱子伦免费精品| 色婷婷久久综合中文久久蜜桃av| 国产精品99久久久精品无码| 久久久久亚洲AV片无码下载蜜桃 | 色婷婷综合久久久久中文一区二区| 欧美成a人片免费看久久| 少妇久久久久久被弄到高潮| 久久午夜福利电影|