zoukankan      html  css  js  c++  java
  • Poj 3094 Quicksum

    1.Link:

    http://poj.org/problem?id=3094

    2.Content:

    Quicksum
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 13925   Accepted: 9719

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

    Sample Input

    ACM
    MID CENTRAL
    REGIONAL PROGRAMMING CONTEST
    ACN
    A C M
    ABC
    BBC
    #

    Sample Output

    46
    650
    4690
    49
    75
    14
    15

    Source

    3.Method:

    簡單題,考了循環的基本用法

    4.Code:

     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstring>
     4 
     5 using namespace std;
     6 
     7 int main()
     8 {
     9     //freopen("D://input.txt","r",stdin);
    10     
    11     int i;
    12     
    13     char str[256];
    14     
    15     cin.getline(str,256);
    16     
    17     while(str[0] != '#')
    18     {
    19         int sum = 0;
    20         for(i = 0; i < strlen(str); ++i)
    21         {
    22             if(str[i] != ' ')
    23             {
    24                 sum += (i + 1) * (str[i] - 'A' + 1); 
    25             } 
    26         }
    27         
    28         cout << sum << endl; 
    29         
    30         cin.getline(str,256);
    31     }
    32     
    33     return 0;
    34 } 

    5:Reference:

    http://blog.csdn.net/steven30832/article/details/6003006

    http://baike.baidu.com/view/2383876.htm

  • 相关阅读:
    转:12款很棒的浏览器兼容性测试工具推荐
    转:精心挑选的12款优秀 jQuery Ajax 分页插件和教程
    权限和ACL访问控制 -01-权限
    实践:Linux用户、组和密码相关文件被破坏如何恢复系统
    用户和组的练习题
    用户和用户组的管理命令
    用户和组文件
    什么是用户和组
    重定向和管道练习题
    管道
  • 原文地址:https://www.cnblogs.com/mobileliker/p/3937148.html
Copyright © 2011-2022 走看看