[Home|Training|Problems|Contests|C Language] | [Login|Register] |

Problems Status Rank |
Problem 1286
Verifying CRC polynomial
Time Limit: 1000ms
Memory Limit: 65536kb Description
Cyclic redundancy check(CRC) is an error-detecting code commonly used many fields. A common misconception is that the “best” CRC polynomials are derived from either an irreducible polynomial or an irreducible polynomial times the factor (1 + If you don’t know what I am talking about, please read the web page in above hyperlink. Given a polynomial of 33 or less bits, please check if it satisfies above condition. Input
The input consists of multiple test cases. Each test case contains a single string of length The input ends with “ Output
For each test case, output “ Sample Input
01 0011 1011 00000100110000010001110110110111 0 Sample Output
Case 1: Yes Case 2: Yes Case 3: No Case 4: Yes |

University of Science and Technology of China

Online Judge for ACM/ICPC

Processed in 2.8ms with 1 query(s).

Online Judge for ACM/ICPC

Processed in 2.8ms with 1 query(s).