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
Output
The Sample Input describes the examples above.
Sample Input
01 10 0010 0000 9 01 10 010 0000 9
Sample Output
Set 1 is immediately decodable Set 2 is not immediately decodable
不一定下面的数据比上面的数据长,还要检查后面的数据会不会成为上面数据的前缀
#include <stdio.h>
int cmp(int n);
char a[800][20];
int main()
{
int i = 0,tf = 0;
int no = 1;
while (gets(a[i]) != NULL)
{
if (a[i][0] == '9')
{
tf = cmp(i - 1);
if (tf)
printf ("Set %d is immediately decodable\n",no);
else
printf ("Set %d is not immediately decodable\n",no);
no++;
i = 0;
continue;
}
i++;
}
return 0;
}
int cmp(int n)
{
char (*p1)[20] = a;
char (*p2)[20] = a;
char *tmp1 = NULL;
char *tmp2 = NULL;
while (*p1 <= a[n])
{
p2 = a;
while (*p2 <= a[n])
{
if (**p1 == **p2)
{
tmp1 = *p1;
tmp2 = *p2;
while (*tmp1 != '\0' && *tmp2 != '\0')
{
if (*tmp1 != *tmp2)
{
break;
}
tmp1++;
tmp2++;
}
if ((*tmp1 == '\0' && *tmp2 != '\0') || (*tmp2 == '\0' && *tmp1 != '\0'))
return 0;
}
p2++;
}
p1++;
}
return 1;
}