POJ3094 UVALive3594 HDU2734 ZOJ2812 Quicksum【进制】
2016-08-13 15:26
357 查看
Quicksum
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 "
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
Sample Output
Source
Mid-Central USA 2006
Regionals 2006 >> North
America - Mid-Central USA
问题链接:POJ3094 UVALive3594 HDU2734 ZOJ2812 Quicksum。
问题简述:输入包含若干行,以'#'结束输入。每行输入大写字母开头的,包含大写字母与空格的字符串,字符数<=255个。编写一个程序将字符串转化为一串数字和。转化算法为:对于每行的每一字符,其位权按顺序分别是1、2、3、4、......;每个字符的值是,空格值为0,字母值为1-26,A=1、B=2、C=3、D=4、......、Z=26。如ACF
E=1*1+2*3+3*6+4*0+5*5=50。
问题分析:(略)
程序说明:(略)
AC的C语言程序如下:
Time Limit: 1000MS | Memory Limit: 65536K | |
Total Submissions: 16976 | Accepted: 11781 |
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
Mid-Central USA 2006
Regionals 2006 >> North
America - Mid-Central USA
问题链接:POJ3094 UVALive3594 HDU2734 ZOJ2812 Quicksum。
问题简述:输入包含若干行,以'#'结束输入。每行输入大写字母开头的,包含大写字母与空格的字符串,字符数<=255个。编写一个程序将字符串转化为一串数字和。转化算法为:对于每行的每一字符,其位权按顺序分别是1、2、3、4、......;每个字符的值是,空格值为0,字母值为1-26,A=1、B=2、C=3、D=4、......、Z=26。如ACF
E=1*1+2*3+3*6+4*0+5*5=50。
问题分析:(略)
程序说明:(略)
AC的C语言程序如下:
/* POJ3094 UVALive3594 HDU2734 ZOJ2812 Quicksum */ #include <stdio.h> int main(void) { int sum, base; char c; sum = 0; base = 0; while((c=getchar()) && c != '#') { base++ ; if('A' <= c && c <= 'Z') sum += (c - 'A' + 1) * base; else if(c == '\n') { printf("%d\n", sum); sum = 0; base = 0; } } return 0; }
相关文章推荐
- POJ1331 UVALive2526 Multiply【暴力+进制】
- UVA713 UVALive5539 POJ1504 ZOJ2001 Adding Reversed Numbers
- poj-3094-quicksum
- POJ2109 ZOJ2486 UVA113 UVALive3098 Power of Cryptography【数学】
- UVALIVE 2675 Peals (POJ 1260 HDU 1300)
- UVALive 7410 && POJ 5583 Kingdom of Black and White (枚举)
- HDU1046 POJ1450 UVALive2334 ZOJ1037 Gridland【数学计算+水题】
- UNIMODAL PALINDROMIC DECOMPOSITIONS - POJ 1221 UVaLive 2560 dp
- POJ 3094 Quicksum
- UVA355 UVALive5249 The Bases Are Loaded【进制】
- Poj 3094 Quicksum
- 曼哈顿最小距离生成树(poj 3241&& UVALive 3662)
- POJ 1459 Power Network / HIT 1228 Power Network / UVAlive 2760 Power Network / ZOJ 1734 Power Network / FZU 1161 (网络流,最大流)
- POJ1552 HDU1303 UVALive2782 ZOJ1760 Doubles【序列】
- poj 3094 Quicksum
- POJ1040 HDU1456 UVA301 UVALive5516 Transportation题解
- POJ 刷题系列:3094. Quicksum
- POJ 3094 Quicksum【水水】
- POJ1555 ZOJ1720 UVA392 UVALive5309 Polynomial Showdown题解
- POJ1503 UVA424 UVALive5399 Integer Inquiry【大数】