Immediate Decodability

Immediate Decodability

Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other)

Total Submission(s) : 9   Accepted Submission(s) : 4

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)

 

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
     
     
     
     

      
      

     
     
     
     

      
      题意：给几段二进制字符，如果其中某个字符串是其他字符串的前缀，则输出not；
     
     
     
     


     
     
     
     

      
      

     
     
     
     

      
      思路，暴力枚举也能过，注意本题的输入的方式，是以9结束一个case的输入；
     
     
     
     

      
      

     
     
     
     

      
      根据本题笔者学到了一个strstr函数，
     
     
     
     

      
      strstr函数：strstr< *str1,*str2>,在str1中查询str2，
如果存在，则返回首个字符在str1出现的地址，如果没有，则返回false;
      
      

     
     
     
     

      
      

     
     
     
     

      
      
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
char s[1000][100];
int num;
int f()
{
    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]==0)//判断s[j]是否在s[i]中的首字符开始出现，出现，减去s[i]说地址则等于0；
                return 1;
        }
    }
    return 0;
}
int main()
{
    int cases=1;
    num=0;
    while(scanf("%s",s[num])!=EOF)
    {
        if(s[num][0]=='9')
        {
            if(f())
                printf("Set %d is not immediately decodable\n",cases++);
            else
                printf("Set %d is immediately decodable\n",cases++);
            num=0;
        }
        else
            num++;
    }
    return 0;
}