Quicksum |
| Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) |
| Total Submission(s): 3401 Accepted Submission(s): 2095 |
|
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 A Quicksum is the sum of the products of ACM: 1*1 + 2*3 + |
|
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 |
|
Sample Output
46 |
|
Source
Mid-Central USA 2006
|
|
Recommend
teddy
|
#include <string.h>
#include <stdio.h> int main()
{
char str[];
int len,i,a[],sum;
for(i = ;i<;i++)
{
a[i] = i+;
}
while(gets(str))
{
if(strcmp(str,"#") == )
break;
len = strlen(str);
sum = ;
for(i = ;i<len;i++)
{
if(str[i]>='A' && str[i]<='Z')
sum+=(i+)*a[str[i]-'A'];
}
printf("%d\n",sum);
} return ;
}