HDU 1305 Immediate Decodability

yiyi:

我是先用qsort()把他们从小到大排序，根据字典序，再用find()函数来查找，只要在当前的这个中找有没前一个存在就可以了。

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 a data file. 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.

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>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
int compare(const void*a,const void *b)
{
	return strcmp((char*)a,(char*)b);
}
int main () {
	char sm[100][50];
	string s1 , s2 ;
	int k = 0;
	int flags = 1;
	int f, term = 0;
	memset (sm, 0, sizeof(sm));
	while (gets(sm[k++])) {
		string	s = sm[k-1];
			if (s == "9") {
				flags = 1;
				qsort (sm, k - 1, 50, compare);
				for (int i = 0; i < k - 2; i++) {
					
					if (strlen(sm[i]) < strlen(sm[i+1])) {
						s1 = sm[i];
					s2 = sm[i + 1];
						f = s2.find(s1);
						if (f == 0) {
							flags = 0;
							term++;
							k = 0;
						memset (sm, 0, sizeof(sm));
					//	s1 = '\0';
					//	s2 = '\0';
						s = '\0';
						printf("Set %d is not immediately decodable\n", term);
						break;
						}
					}
				}
				if (flags == 1) {
					flags = 0;
					term++;
					k = 0;
					memset (sm, 0, sizeof(sm));
					//s1 = '\0';
					//s2 = '\0';
					s = '\0';
					printf("Set %d is immediately decodable\n", term);
				}
			}
	}
	return 0;
}