Uva 644-Immediate Decodability(串)
来源:互联网 发布:怎么添加打印机端口 编辑:程序博客网 时间:2024/06/05 16:03
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
0110001000009011001000009
Sample Output
Set 1 is immediately decodableSet 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++);elseprintf("Set %d is not immediately decodable\n",cas++);p=0;}return 0;}
0 0
- Uva 644-Immediate Decodability(串)
- uva 644 Immediate Decodability
- UVa 644 - Immediate Decodability
- UVa 644 - Immediate Decodability
- uva-644 - Immediate Decodability
- uva 644 Immediate Decodability
- UVA 644 Immediate Decodability
- UVA 644 Immediate Decodability
- UVa 644 - Immediate Decodability
- UVa 644 - Immediate Decodability
- UVA 644 Immediate Decodability
- UVa - 644 - Immediate Decodability
- uva 644 - Immediate Decodability
- UVA 644 Immediate Decodability
- uva 644 Immediate Decodability
- uva - 644 - Immediate Decodability
- UVA 644Immediate Decodability
- UVa 644 - Immediate Decodability
- HDU 5011 Game 【Nim博弈】
- codeforces 476c Dreamoon and Sums
- opengl教程
- CodeForces 486C Palindrome Transformation
- libevent2源码 min_heap
- Uva 644-Immediate Decodability(串)
- 备份基本原理
- C++ STL删除元素的一些案例
- 【树套树】【bzoj 3236】: [Ahoi2013]作业
- Send a Table
- Android: 读取短信
- Anti-alias的前世今生
- 【计算几何】 POJ 1556 The Doors
- kinect