UVA 644(字符串)
来源:互联网 发布:华彩人生一点通 mac 编辑:程序博客网 时间:2024/06/05 06:37
n 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
题目大意:如果二进制形式里有一条是某一条的前缀,则是NOT IMMEDIATELY,否则IMMEDIATELY,以9作为结束。
方法:用QSORT排好序后,用上次学到的STRING 的FING,利用位置返回值判断。
#include<stdio.h>#include<string.h>#include<string>using namespace std;int comp(const void*a,const void *b){return strcmp((char*)a,(char*)b);}int main () {char str1[100][50];memset(str1,0,sizeof(str1));int z=0;int b=1;int a=0;int i=0;int h=0;int num=0;int f;string s1;string s2;while(gets(str1[z++])) {string s=str1[z-1];while (s=="9") {b=1;qsort(str1,z-1,50,comp);for(i=0;i<z-2;i++) {if(strlen(str1[i])<strlen(str1[i+1])) {s1=str1[i];s2=str1[i+1];f=s2.find(s1);if(f==0) {a++;z=0;b=0;memset(str1,0,sizeof(str1));s="\0";printf("Set %d is not immediately decodable\n",a);break;}}}if(b==1) {a++;z=0;memset(str1,0,sizeof(str1));s="\0";printf("Set %d is immediately decodable\n",a);}}}return 0;}
- UVA 644(字符串)
- UVA 644 - Immediate Decodability(字符串)
- uva 644 Immediate Decodability(字符串处理)
- uva 644(字符串)
- uva 10361(字符串)
- UVA 10815(字符串)
- UVA 10115(字符串)
- UVA 10878(字符串)
- uva 409(字符串模拟)
- UVA 401 - Palindromes(字符串)
- UVA 10010(查找字符串)
- uva 644 Immediate Decodability(字符串比对)
- Immediate Decodability - UVa 644 字符串处理
- 字符串训练 ----- UVA 644题目 Immediate Decodability
- UVA 10010 - Where's Waldorf?(字符串)
- UVA 10361 - Automatic Poetry(字符串)
- UVA 537 - Artificial Intelligence?(字符串)
- UVA 409 - Excuses, Excuses!(字符串)
- linux中软件包管理
- 如何更改linux文件的拥有者及用户组(chown和chgrp)
- str.find() & str.rfind()
- scrapy模拟登录微博
- UVa1025
- UVA 644(字符串)
- /dev/null和/dev/tty
- C++关键字
- git学习笔记1- git 概念-依据git权威指南
- Java中用final修饰的变量
- 脱壳学习笔记一:常用工具
- OC_数组
- Android中WebView与JS的交互
- Asteroids!-裸的BFS