标签:des style io color ar os sp for strong
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
一个串不能是另一个串的前缀。
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> #include<map> typedef long long LL; using namespace std; #define REPF( i , a , b ) for ( int i = a ; i <= b ; ++ i ) #define REP( i , n ) for ( int i = 0 ; i < n ; ++ i ) #define CLEAR( a , x ) memset ( a , x , sizeof a ) //map<string,int>q; char str[1100][10],s[10]; int main() { int cas=1; std::ios::sync_with_stdio(false); while(cin>>str[0]) { int l=1; char *p; while(cin>>str[l]&&str[l++][0]!='9'); int flag=1; REP(i,l-1) { REP(j,l-1) { if(i==j) continue; p=strstr(str[i],str[j]); if((p-str[i])==0) { flag=0; break; } } } if(flag) printf("Set %d is immediately decodable\n",cas++); else printf("Set %d is not immediately decodable\n",cas++); } return 0; }
UVA 644 Immediate Decodability (字符处理)
标签:des style io color ar os sp for strong
原文地址:http://blog.csdn.net/u013582254/article/details/40915481