zoukankan      html  css  js  c++  java
  • zju 2812 Quicksum---------hdu 2734

    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>
    #include<stdio.h>
    #include<map>
    using namespace std;
    int main(int argc, char *argv[])
    {
     map<char,int> a;
     map<char,int>::iterator b;
     char s[256];
     char c=' ';
     a[c]=0;
     int i=1,j,sum;
     for(c='A';c<='Z';c+=1)
      a[c]=i++;
     //for(b=a.begin();b!=a.end();b++)
     // cout<<b->first<<" "<<b->second<<endl;
     while(gets(s))
     {
      if(s[0]=='#') break;
      sum=0;
      for(i=0;s[i];i++)
       for(b=a.begin();b!=a.end();b++)
        if(s[i]==b->first) sum+=(i+1)*(b->second);
      cout<<sum<<endl;  
     }
     return 0;
    }
    View Code

    #include <iostream>
    #include<string>
    #include<stdio.h>
    #include<map>
    using namespace std;
    int main(int argc, char *argv[])
    {
     map<char,int> a;
     map<char,int>::iterator b;
     char s[256];
     char c=' ';
     a[c]=0;
     int i=1,j,sum;
     for(c='A';c<='Z';c+=1)
      a[c]=i++;
     //for(b=a.begin();b!=a.end();b++)
     // cout<<b->first<<" "<<b->second<<endl;
     while(gets(s))
     {
      if(s[0]=='#') break;
      sum=0;
      for(i=0;s[i];i++)
       for(b=a.begin();b!=a.end();b++)
        if(s[i]==b->first) sum+=(i+1)*(b->second);
      cout<<sum<<endl;  
     }
     return 0;
    }

    #include<iostream>
    #include<cstring>
    #include<string>
    using namespace std;
    int main()
    {
        string s;
        int sum,i;
        while(getline(cin,s))
        {    
            if(s[0]=='#') break;
            sum=0;
            for(i=0;i<s.size();i++)
                if(s[i]==' ') sum+=0;
                else sum+=(i+1)*(s[i]-'A'+1);
            cout<<sum<<endl;
        }
        return 0;
    }
    View Code
    #include<iostream>
    #include<cstring>
    #include<string>
    using namespace std;
    int main()
    {
    string s;
    int sum,i;
    while(getline(cin,s))
    {
    if(s[0]=='#') break;
    sum=0;
    for(i=0;i<s.size();i++)
    if(s[i]==' ') sum+=0;
    else sum+=(i+1)*(s[i]-'A'+1);
    cout<<sum<<endl;
    }
    return 0;
    }
  • 相关阅读:
    IP和MAC
    ASCII,Unicode 和 UTF-8
    php(PHP Hypertext Preprocessor)随笔1
    css层叠样式表 (Cascading Style Sheets)初识
    ansible部署
    mysql三种备份方式
    nginx反向代理,负载均衡,动静分离,rewrite地址重写介绍
    Maven安装和配置
    jenkins之Tomcat7+jdk1.7+jenkins
    CentOS 7.0如何安装配置iptables和seLinux以及firewalld
  • 原文地址:https://www.cnblogs.com/2014acm/p/3885710.html
Copyright © 2011-2022 走看看