Immediate Decodability
Time Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)
Total Submission(s) : 4 Accepted Submission(s) : 3
Problem 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)
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 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
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>
#include<string.h>
#include<stdlib.h>
char s[1000][100];
int num;
int find()
{
int i,j;
for(i=0;i<num;i++)
for(j=0;j<num;j++)
{
if(i==j)continue;
if(strstr(s[i],s[j])==s[i])//在字符串s[i]中查找字符串s[2],在字符串s[i]中,寻找字串str[j],若找到返回找到的位置,判断和s[i]是否相等,相等返回0
{
return 0;
}
}
return 1;
}
int main()
{
int case1=1;
num=0;
while(scanf("%s",s[num])!=EOF)
{
if(s[num][0]=='9')
{
if(find())
printf("Set %d is immediately decodable\n",case1++);
else
printf("Set %d is not immediately decodable\n",case1++);
num=0;
}
else
num++;
}
return 0;
}
思路:主要学习了strstr(s1,s2)函数
- 函数名: strstr
- 功能:找出字符串str2在字符串str1中第一次出现的位置(不包括str2的串结束符)。
- 返回值:若找到,返回指向该位置的指针;否则,返回空指针