HDU1626 ZOJ1164 UVA128 Software CRC【循环校验码】

Software CRC

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 204    Accepted Submission(s): 53


Problem Description
You work for a company which uses lots of personal computers. Your boss, Dr Penny Pincher, has wanted to link the computers together for some time but has been unwilling to spend any money on the Ethernet boards you have recommended. You, unwittingly, have pointed out that each of the PCs has come from the vendor with an asynchronous serial port at no extra cost. Dr Pincher, of course, recognizes her opportunity and assigns you the task of writing the software necessary to allow communication between PCs.  

You've read a bit about communications and know that every transmission is subject to error and that the typical solution to this problem is to append some error checking information to the end of each message. This information allows the receiving program to detect when a transmission error has occurred (in most cases). So, off you go to the library, borrow the biggest book on communications you can find and spend your weekend (unpaid overtime) reading about error checking.  

Finally you decide that CRC (cyclic redundancy check) is the best error checking for your situation and write a note to Dr Pincher detailing the proposed error checking mechanism noted below.  

CRC Generation  

The message to be transmitted is viewed as a long positive binary number. The first byte of the message is treated as the most significant byte of the binary number. The second byte is the next most significant, etc. This binary number will be called ``m'' (for message). Instead of transmitting ``m'' you will transmit a message, ``m2'', consisting of ``m'' followed by a two-byte CRC value.  

The CRC value is chosen so that ``m2'' when divided by a certain 16-bit value ``g'' leaves a remainder of 0. This makes it easy for the receiving program to determine whether the message has been corrupted by transmission errors. It simply divides any message received by ``g''. If the remainder of the division is zero, it is assumed that no error has occurred.  

You notice that most of the suggested values of ``g'' in the book are odd, but don't see any other similarities, so you select the value 34943 for ``g'' (the generator value).
 

Input
You are to devise an algorithm for calculating the CRC value corresponding to any message that might be sent. To test this algorithm you will write a program which reads lines (each line being all characters up to, but not including the end of line character) as input, and for each line calculates the CRC value for the message contained in the line, and writes the numeric value of the CRC bytes (in hexadecimal notation) on an output line. Each input line will contain no more than 1024 ASCII characters. The input is terminated by a line that contains a # in column 1. Note that each CRC printed should be in the range 0 to 34942 (decimal).  
 

Sample Input
 
  
this is a test A #
 

Sample Output
 
  
77 FD 00 00 0C 86
 

Source
uva

问题链接HDU1626 ZOJ1164 UVA128 Software CRC

问题简述:(略)

问题分析

  这是一个经典的计算字符串的循环校验码问题。一般情况下,计算一个文件的循环校验码 。

  要尽可能不使用缓冲区。

  要尽可能避免使用共用存储结构。

程序说明:(略)

题记:(略)


参考链接:(略)


AC的C++语言程序如下
/* HDU1626 ZOJ1164 UVA128 Software CRC */

#include <iostream>
#include <stdio.h>

using namespace std;

const int G = 34943;

int main()
{
    for(;;) {
        unsigned int a = 0;
        unsigned char c;
        int cnt = 0;

        while(scanf("%c", &c) == 1 && c != '#' && c != '\n') {
            cnt++;
            a = ((a << 8) + c) % G;
        }

        // 判定结束条件
        if(cnt == 0 && c == '#')
            break;

        // 移位到高字节,计算CRC
        a = (a << 16) % G;
        if(a)
            a = G - a;

        unsigned char *p =  (unsigned char *)&a;
        printf("%02X %02X\n", *(p + 1), *p);
    }

    return 0;
}
相关文章
相关标签/搜索
每日一句
    每一个你不满意的现在,都有一个你没有努力的曾经。
本站公众号
   欢迎关注本站公众号,获取更多程序园信息
开发小院