标签:des style blog io ar color os sp for
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
水题 。。
给一个含有n个串的集合,如果所有的串都不是其他串的前缀,则称此串为immediately decodable 否则不是。。
暴力判就ok了。。
#include <algorithm> #include <iostream> #include <cstring> #include <cstdlib> #include <string> #include <cctype> #include <vector> #include <cstdio> #include <cmath> #include <queue> #include <stack> #include <map> #include <set> #define ll long long #define maxn 360 #define pp pair<int,int> #define INF 0x3f3f3f3f #define max(x,y) ( ((x) > (y)) ? (x) : (y) ) #define min(x,y) ( ((x) > (y)) ? (y) : (x) ) using namespace std; char s[15][15]; int p=0; bool judge() { for(int i=0;i<p;i++) for(int j=0;j<p;j++) if(j!=i&&strlen(s[i])<=strlen(s[j])&&!strncmp(s[i],s[j],strlen(s[i]))) return false; return true; } int main() { int cas=1; while(scanf("%s",s[p++])!=EOF) { while(scanf("%s",s[p++])!=EOF&&s[p-1][0]!='9'); if(judge()) printf("Set %d is immediately decodable\n",cas++); else printf("Set %d is not immediately decodable\n",cas++); p=0; } return 0; }
Uva 644-Immediate Decodability(串)
标签:des style blog io ar color os sp for
原文地址:http://blog.csdn.net/qq_16255321/article/details/41358037