poj1056

最新推荐文章于 2020-10-19 15:29:56 发布

weixin_34179968

最新推荐文章于 2020-10-19 15:29:56 发布

阅读量177

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/eric-blog/archive/2011/05/31/2065114.html

本文介绍了一种用于检测一组符号编码是否具有立即解码性的算法。算法通过检查每个编码是否为其他编码的前缀来判断编码集的性质。输入为一系列包含不同符号的二进制编码集合，输出为每组编码是否具有立即解码性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

IMMEDIATE DECODABILITY

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 7371		Accepted: 3513

Description

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)

Input

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).

Output

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.

Sample Input

Sample Output

Set 1 is immediately decodable
Set 2 is not immediately decodable

Source

Pacific Northwest 1998

水过

#include <iostream>

using namespace std;

char code[9][11];

bool checkPrefix(const char *src, const char *dst)
{
    int i=0;
    bool flag=true;

    while(src[i]!='\0')
    {
        if(src[i]!=dst[i])
            flag=false;
        i++;
    }
    return flag;
}

int main()
{
    int i,cas=1;
    bool isPrefix, isCode;

    while(cin>>code[0])
    {
        i=1;
        isCode=true;
        while(cin>>code[i] && code[i][0]!='9')
            i++;

        for(int j=0; j<i; j++)
        {
            for(int k=0; k<i; k++)
            {
                if(k==j)
                    continue;
                if(checkPrefix(code[j],code[k]))
                {
                    isCode=false;
                    break;
                }
            }
        }

        if(isCode)
            cout<<"Set "<<cas<<" is immediately decodable"<<endl;
        else
            cout<<"Set "<<cas<<" is not immediately decodable"<<endl;
        cas++;
    }
    return 0;
}

转载于:https://www.cnblogs.com/eric-blog/archive/2011/05/31/2065114.html