uva 644 Immediate Decodability(字符串处理)
2013-07-25 00:17
267 查看
Immediate Decodability |
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 zeroesand 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 linegiving 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
题目大意:判断所给的字符串中有无前缀。
解题思路:将所给字符串用sort函数按长度排序,然后二重循环逐一判断。(注意长字符串不能做短字符串的前缀)
#include<iostream> #include<string.h> #include<algorithm> using namespace std; #define N 101 #define M 50 struct T{ char str[M]; }; int cmp(const T &a, const T &b) { return strlen(a.str) < strlen(b.str); } int main() { T tem ; int cnt = 0; int t = 1; int bo = 0; while(cin >> tem[cnt].str) { if (strcmp(tem[cnt++].str, "9")) continue; sort(tem, tem + cnt, cmp); for (int i = 0; i < cnt; i++) { int k = strlen(tem[i].str); for (int j = i + 1; j < cnt; j++) { if (strncmp(tem[i].str, tem[j].str, k) == 0) { bo = 1; break; } } if (bo) break; } if (bo) cout << "Set " << t++ << " is not immediately decodable" << endl; else cout << "Set " << t++ << " is immediately decodable" << endl; // Init. memset(tem, 0, sizeof(tem)); bo = 0; cnt = 0; } return 0;}
相关文章推荐
- Immediate Decodability - UVa 644 字符串处理
- UVA - 1368 DNA Consensus String :简单字符串处理
- Palindromes - UVa 401 字符串处理
- UVA - 10340 All in All :简单字符串处理
- UVA 232 字符串处理
- Seoul 2006 / UVa 1368 DNA Consensus String (字符串处理)
- UVa 10340 All in All (字符串处理&编程技巧)
- uva140Bandwidth带宽——字符串处理加全排列
- uva 1339 Ancient Cipher(字符串处理)
- uva 475 - Wild Thing(字符串处理)
- UVA232字符串处理
- UVA 282 - Rename(字符串处理)
- UVA 10082 WERTYU字符串处理
- uva 502 DEL command(字符串处理)
- uva 644 Immediate Decodability(字符串比对)
- [ACM_模拟] UVA 12504 Updating a Dictionary [字符串处理 字典增加、减少、改变问题]
- Unix is 命令 (排序和字符串处理) UVA - 400
- UVa10391 string字符串处理
- uva 10361 Automatic Poetry(字符串处理)
- UVA 156 Ananagrams 模拟+字符串处理