标签:
Immediate Decodability |
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)
The Sample Input describes the examples above.
01 10 0010 0000 9 01 10 010 0000 9
Set 1 is immediately decodable Set 2 is not immediately decodable
题意:对于二进制编码,找是否有有一个二进制编码是另一个的前缀,如果有输出 not immediately,没有输出 immediately。
思路:暴力比较,也可以用字典树,改天更新
#include <stdio.h> #include <string.h> #include <stdlib.h> #include <algorithm> #include <iostream> using namespace std; int cmp(char *str1,char *str2) { int i; int len,len1,len2; len1=strlen(str1); len2=strlen(str2); len=min(len1,len2); for(i=0;i<len;i++) { if(str1[i]!=str2[i]) return 1; } return 0; } int main() { char str[20][20]; int n,i,j; int t=1; int flag; while(scanf("%s",str[0])==1) { n=1; flag=0; while(scanf("%s",str[n])&&str[n][0]!='9') { n++; } for(i=0;i<n;i++) { for(j=i+1;j<n;j++) { if(cmp(str[i],str[j])==0) { flag=1; break; } } if(flag) break; } if(!flag) printf("Set %d is immediately decodable\n",t++); else printf("Set %d is not immediately decodable\n",t++); } return 0; }
UVA 644- Immediate Decodability (寻找是否有相同前缀)
标签:
原文地址:http://blog.csdn.net/u013486414/article/details/42192697