zoukankan      html  css  js  c++  java
  • zoj 2812

    Quicksum

    Time Limit: 2 Seconds      Memory Limit: 65536 KB

    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 = 46
    
    MID 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.

    #include <iostream>
    #include <string>
    using namespace std;
    int main(){
        string s;
        while(getline(cin, s)){
            if(s[0] == '#'){
                break;
            }
            int l = s.length(), sum = 0;
            for(int i = 0; i < l; i++){
                if(s[i] != ' '){
                    int t = (int)(s[i] - 'A') + 1;
                    sum += (i + 1) * t;
                    //cout << t << " ";
                }
            }
            cout << sum << endl;
        }
        return 0;
    }
     1 #include <iostream>
     2 #include <fstream>
     3 using namespace std;
     4 int main(){
     5     ifstream cin("aaa.txt");
     6     char ch;
     7     int i = 1;
     8     int sum = 0;
     9     //cin会忽略回车、空格、Tab跳格
    10     //采用cin.get()一个一个读,就不会忽略任何字符
    11     //也可采用cin.getline()一行一行读入
    12     while(cin.get(ch)){
    13         if(ch == '#') break;
    14         if(ch != '
    '){
    15             if(ch != ' ')
    16                 sum += i * (ch - 64);
    17             i++;
    18         } 
    19         if(ch == '
    '){
    20             cout << sum << endl;
    21             sum = 0;
    22             i = 1;
    23         }
    24     }
    25     return 0;
    26 }
     1 #include <iostream>
     2 #include <fstream>
     3 using namespace std;
     4 int main(){
     5     ifstream cin("aaa.txt");
     6     char ch[256];
     7     int sum;
     8     while(cin.getline(ch, 256)){
     9         sum = 0;
    10         if(ch[0] == '#')
    11             break;
    12         for(int i = 0; ch[i] != ''; i++){
    13             if(ch[i] != ' ')
    14                 sum += (i + 1) * (ch[i] - 64);
    15         }
    16         cout << sum << endl;
    17     }
    18     return 0;
    19 }

    Example Input: Example Output:
    ACM
    MID CENTRAL
    REGIONAL PROGRAMMING CONTEST
    ACN
    A C M
    ABC
    BBC
    #
    46
    650
    4690
    49
    75
    14
    15
  • 相关阅读:
    fiyocms 2.0.6.1版本漏洞复现及分析
    WPScan使用方法
    sqlmap的使用方法(含靶场)
    COOKIE注入靶场实战
    LDAP注入学习小记
    XSS挑战赛通关
    LANMP安全配置之Nginx安全配置
    LANMP安全配置之MySQL安全配置
    LANMP安全配置之Apache安全配置
    open-source
  • 原文地址:https://www.cnblogs.com/qinduanyinghua/p/6519428.html
Copyright © 2011-2022 走看看