OpenJudge

1056:IMMEDIATE DECODABILITY

总时间限制:
1000ms
内存限制:
65536kB
描述
An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in binary, that no two codes within a set of codes are the same, that each code has at least one bit and no more than ten bits, and that each set has at least two codes and no more than eight.

Examples: Assume an alphabet that has symbols {A, B, C, D}

The following code is immediately decodable:
A:01 B:10 C:0010 D:0000

but this one is not:
A:01 B:10 C:010 D:0000 (Note that A is a prefix of C)
输入
Write a program that accepts as input a series of groups of records from standard input. Each record in a group contains a collection of zeroes and ones representing a binary code for a different symbol. Each group is followed by a single separator record containing a single 9; the separator records are not part of the group. Each group is independent of other groups; the codes in one group are not related to codes in any other group (that is, each group is to be processed independently).
输出
For each group, your program should determine whether the codes in that group are immediately decodable, and should print a single output line giving the group number and stating whether the group is, or is not, immediately decodable.
样例输入
01
10
0010
0000
9
01
10
010
0000
9
样例输出
Set 1 is immediately decodable
Set 2 is not immediately decodable
 
来源
Pacific Northwest 1998
全局题号
58
添加于
2009-10-29
提交次数
177
尝试人数
86
通过人数
68
您的评价 很水 简单 一般 较难 变态
  • 标签(多个标签用空格分隔):
  • 常用标签:
    递归   动态规划   贪心   搜索   枚举   模拟   数学   字符串处理   几何   高精度计算   图论  

共有5人评分

20.0%
0.0%
0.0%
40.0%
40.0%

已有的标签

Trie(1) 字典树(1) 字符串处理(1)