Search - ASCII - CodeBus

Search - ASCII - List

[Data structs] 用乘同余法产生随机数-matlab DL : 0: 用乘同余法，产生(-1，1)均匀分布的随机序列，给出数据并画图

Date : 2008-01-08 Size : 286byte User : wander
[Data structs] stringcmp DL : 0: 设A和B是长度相同的2个字符串。A和B的距离定义为相应位置字符距离之和。2个非空格字符的距离是它们的ASCII码之差的绝对值。空格与空格的距离为0；空格与其它字符的距离为一定值k。字符串A的扩展是在A中插入若干空格字符所产生的字符串。在字符串A和B的所有长度相同的扩展中，有一对距离最小的扩展，该距离称为字符串A和B的扩展距离。对于给定的字符串A和B，试设计一个算法，计算其扩展距离。 -Let A and B is the same length of two strings. A and B is defined as the distance between the corresponding location and distance characters. Two non-space character, the distance between them is the ASCII of absolute poor. And the blank spaces in the range of 0; Space with other characters to a certain distance from the k value. A string of expansion is inserted in A certain space character from the string. In the A and B string in all the same length of the extension, a minimum distance of the expansion, The distance from the string as A and B from the expansion. For a given string, A and B, test design an algorithm to calculate the distance of expansion.
Date : 2025-12-22 Size : 162kb User : wu
[Data structs] Huffman DL : 1: 根据ascii码文件中各ascii字符出现的频率情况创建Haffman树，再将各字符对应的哈夫曼编码写入文件中，实现文件压缩。-In accordance with ascii code ascii characters in the document the frequency of the situation created Haffman tree, and then the character of the Huffman code corresponding to write documents, files compression.
Date : 2025-12-22 Size : 797kb User : 郭峰
[Data structs] cPP DL : 0: 求出平均分、最高分和最低分，冒泡法排序，求绝对值函数，可以对整型、双精度型、字符型数据（ascii值）、复数求绝对值。二维数组的行和列元素互换，三个字符串，要求找出其中最大者，字符串拷贝的函数-Find the average, highest and lowest points, bubble sort method, find the absolute value function, can be an integer, double, character data (ascii value), complex absolute value. Two-dimensional array of rows and columns elements of exchange, three strings, asked to identify the greatest of the string copy function
Date : 2025-12-22 Size : 7kb User : shizhandong
[Data structs] huffmancode DL : 0: 一个哈夫曼算法.具体题目如下: 题目要求：1）建立一正文文件(本程序中建立的文件名文test.txt)，向其中输入字符（本程序中可输入任意ASCII值） 2）通过哈夫曼算法求出文件中字符的相应编码 3）建立一与正文文件(test.txt)对应的编码文件（本程序中为bainma.txt）--a Huffman algorithm. Specific topics are as follows : Subject : 1) the establishment of a text document (the procedures established in the File Name text test.txt), which imported to the character (this program can import arbitrary ASCII values) 2) by Huffman algorithm obtained documents characters The corresponding coding 3) and the establishment of a text document (test.txt) corresponding encoded files (the procedures for bainma.txt)
Date : 2025-12-22 Size : 1kb User : 朱绍
[Data structs] test1_2 DL : 0: 求X和Y两个字符串的最长公共子序列。（X和Y字符串分别存放在ASCII码文件2X.txt和2Y.txt中) 要求：根据动态规划法基本设计思想，将实现任务的C语言程序代码和运行结果填写在试卷上。 -Two strings X and Y find the longest common subsequence. (X and Y strings are stored in ASCII files 2X.txt and 2Y.txt in) requirements: According to the basic design of dynamic programming ideas to achieve the mission of the C language code and fill in the papers on the results.
Date : 2025-12-22 Size : 179kb User : youbin
[Data structs] 40 DL : 0: 函数fun的功能是：将s所指字符串中ASCII值为奇数的字符删除，串中剩余字符形成一个新串放在t所指的数组中。例如，若s所指字符串中的内容为：〞ABCDEFG12345〞,其中字符A的ASCII码值为奇数、…、字符1的ASCII码值也为奇数、…都应当删除，其它依此类推。最后t所指的数组中的内容应是：〞BDF24〞。注意：部分源程序存在文件PROG1.C中请勿改动主函数main和其它函数中的任何内容，仅在函数fun的花括号中填入你编写的若干语句 -Function fun feature is: s referred to an odd string of ASCII characters is removed, the remaining character string to form a new string on the t refers to the array. For example, if the contents of the string s referred to as: " ABCDEFG12345" , in which character A, ASCII code is odd, ..., character 1, ASCII code value is odd, ... should be removed, the other and so on. T refers to the final contents of the array should be: " BDF24" . Note: Some source code changes do not exist in the file PROG1.C main function and other functions in any content, only the braces in the function fun fill you write a number of statements
Date : 2025-12-22 Size : 4kb User : 储谢东
[Data structs] TLV(201108021436) DL : 0: TLV结构的构建及解析，查找，取值等功能,可以用ASCII方式查询也可以用BCD码方式查询。-TLV struct create,find and get vaule.....
Date : 2025-12-22 Size : 22kb User :
[Data structs] Huffman DL : 0: 中国海洋大学数据结构课程设计课题本人作品,利用哈弗曼编码原理实现对ascii字符文本文件的压缩与解压处理.压缩率为58 -60 .-Ocean University of China data structures course design project I work, the use of Hafu Man coding theory to achieve the ascii characters of the text file compression and decompression processing. Compression rate of 58 -60 .
Date : 2025-12-22 Size : 3kb User : 姜俊
[Data structs] 3 DL : 0: 完成排序；接收用户输入的可显示字符串，以回车结束。程序按ASCII码值大小由大到小排序并输出显示； -Receive user input to display the string, end with a carriage return. ASCII value of the program size by descending order and output display
Date : 2025-12-22 Size : 1kb User : leeyue
[Data structs] project1 DL : 0: 本项目主要完成对局用程控交换机的二进制磁带卸载数据，按照一定的格式要求，转化成标准ASCII码格式并以文本形式输出，然后再经过内存排序后，提供给后续计费模块进行批价处理。-The project was completed for the binary PBX game with tape unload data, according to certain format requirements, into a standard ASCII format Type and output as text, and then sorted through the memory available to the billing module for the grant price of the follow-up treatment.
Date : 2025-12-22 Size : 8kb User : 闫晗
[Data structs] 2 DL : 0: 设计一个哈夫曼编码、译码系统。对一个ASCII编码的文本文件中的字符进行哈夫曼编码，生成编码文件；反过来，可将编码文件译码还原为一个文本文件。（1）从文件中读入任意一篇英文短文（文件为ASCII编码，扩展名为txt）；（2）统计并输出不同字符在文章中出现的频率（空格、换行、标点等也按字符处理）；（3）根据字符频率构造哈夫曼树，并给出每个字符的哈夫曼编码；（4）图形化输出哈夫曼树、哈夫曼编码；（5）将文本文件利用哈夫曼树进行编码，存储成压缩文件（编码文件后缀名.huf）（6）用哈夫曼编码来存储文件，并和输入文本文件大小进行比较，计算文件压缩率；（7）进行译码，将huf文件译码为ASCII编码的txt文件，与原txt文件进行比较。 -The design of a Huffman encoding, decoding system. On a ASCII encoded characters in text files Huffman coding, to generate an encoded document in turn, the encoded file decoding back into a text file.( 1) from the document read any English short essay ( file for the ASCII encoding, TXT extension ) ( 2) statistics and the output of different characters in the article appears in the frequency (spaces, newlines, punctuation but by character processing ) ( 3 ) according to the frequencies of characters Huffman tree structure, and gives each character of the Huffman coding ( 4) graphical output, Huffman tree Huffman coding ( 5) will be a text file using Huffman tree coding, stored as a compressed file ( coding file name suffix . HUF )( 6) the use of Huffman coding to store files, and to input text file size compared to calculate, file compression rate ( 7) decoding, the HUF file decoding for ASCII encoding txt files, and txt files are compared.
Date : 2025-12-22 Size : 2.71mb User : eric
[Data structs] CP340_CP341_MODBUS_POLL_SLAVE DL : 5: 自己写的MODBUS主站程序使用SCL写（含源码）使用SCL写的，程序显得比较大。还有从站的程序也同时奉上。 Modbus 主站说明主要程序列表主站轮询调度程序背景数据块 DB200 POLL_MANAGER2_DB 通信对象数据块 DB203 OBJECT_IMAGES 设备读写的数据数据块 DB204 SUB_STATION_DATAS 主站轮询调度程序 FB200 POLL_MANAGER2 Modbus主站程序 FB201 MOD_POLL 初始化通信对象及主站调用 FC201 POLL_COMMUNICATION2 Modbus Ascii 16进制转换Ascii码 FC203 MOD_HTA Modbus Ascii Ascii码转换16进制 FC204 MOD_ATH Modbus RTU CRC程序 FC205 CRC16F Modbus Ascii LRC程序 FC206 LRC 按位处理的块移动程序 FC220 BBLKMOV ANY指针数据结构 UDT61 ANY_STRUCT 通信设备对象数据结构 UDT62 DEVICE_OBJECT -MODBUS cp341
Date : 2025-12-22 Size : 644kb User : www
[Data structs] chengxu DL : 0: 从一文本中读取单词，统计其出现的频率，并按频率大小输出到另一文本中。这里的单词是分二种，一种是ASCII码大于0x20小于0X80字符，第二种是小于0x20以及大于0x80的字符。这里我用的是哈希表，这样能很快查找读取的单词是否已经存在。排序我用的是二个循环，按理来说可以改进-It is very good program!
Date : 2025-12-22 Size : 2kb User : wangjianming
[Data structs] LCS DL : 0: 用Java实现的LCS最大公共子序列算法，输入从文件中读取ASCII码-LCS common subsequence algorithm implemented in Java, the input is read from the file in ASCII
Date : 2025-12-22 Size : 3kb User : xiaotian
[Data structs] Readaws DL : 0: 1 批处理-首先要list要处理的文件（*.0000）到ascii文件中，在*aws_nl中填写好输入和输出路径（包含文件路径和经纬度文件路径），适合所有的micaps资料 2 读取MICAPS第一类数据格式 3 输出任何时间、区域（需要改区域详细的经纬度资料--很难哦）-READ MICAPS Diamond 1 DATA with fortran
Date : 2025-12-22 Size : 3kb User : 国世邦
[Data structs] poj1200 DL : 0: 北大poj1200 利用ascii码巧妙将数字转化为nc进制再进行简单的hash判断-poj1200 crazy search
Date : 2025-12-22 Size : 1kb User : 明明
[Data structs] ASCII-(Byte) DL : 0: ASCII Character Code
Date : 2025-12-22 Size : 441kb User : ryan
[Data structs] huffman DL : 0: 基于Huffman编码的文件压缩设计:本次实验将文件中的字符作为结点，每个字符在文件中出现的频率作为结点的权值，采用Huffman算法构造Huffman树，将字符用尽可能短的二进制数位表示（频率越低，二进制数位越长），而不是用8位的ASCII码进行存储，已达到节省存储空间，压缩文件的目的。程序设计的步骤如下： 1、统计需压缩文件中每个字符出现的频率； 2、将每个字符出现的频率作为叶子结点构建Huffman树，然后将树中结点引向其左孩子的分支标“0”，引向其右孩子的分支标“1”；每个字符的编码即为从根到每个叶子的路径上得到的0、1序列，这样便完成了Huffman编码，将每个字符用最短的二进制字符表示； 3、打开需压缩文件，再将需压缩文件中的每个ASCII码对应的huffman编码按bit单位输出。文件压缩结束。压缩文件里面包括了源代码，运行程序，设计说明书和使用说明书。-The experiment will document the frequency of characters as nodes, each character appears in the file as a node weights, using Huffman algorithm Huffman tree structure, the character with the shortest possible representation of binary digits (the lower the frequency, binary digit longer), instead of storing 8-bit ASCII code, has been reached to save storage space, archive purposes.
Date : 2025-12-22 Size : 76kb User :
[Data structs] shujujiegou DL : 0: 编制一个将待格式化的文本按照一定的版面要求重新排版并输出到文件的程序 [基本要求] （1）文本文件非空且以文本文件形式存放（为空没有格式化意义）。输入输出文件名均由用户从键盘输入。（2）字的定义：由非（‘@’，‘ ’(空格)）的任意ASCII码字符组成。（3）文本文件的定义：由字母字符，数字字符，空格和可以用ASCII代码显示的字符组成。‘@’只表示换行的意义。‘ ’(空格)只表示一个字的结束的意义。（4）任何完整的字都没有被分割在两行:，行尾不齐没关系，但要实现左对齐。每行字符数不超过60。（5）输出文件中字与字之间只留一个空格符，即实现多余空格符的压缩。（6）符号‘@’指示它后面的正文在格式化时应另起一段排放，段首缩入8个字符的位置。-Preparing a formatted text will be reformatted in accordance with certain requirements and output to a file layout program [basic requirements] (1) non-empty text file and stored as a text file (no blank formatted sense). Input and output file name by user input the keyboard. Definition (2) the word: non ( @ , (space)) of any of the ASCII characters. (3) to define the text file: the alphabetic characters, numeric characters, spaces, and characters can be displayed using the ASCII code for composition. @ Shows only significance wrap. (Blank) shows only the meaning of a word ends. (4) any complete word have been divided in two lines: the line end arrhythmia does not matter, but to achieve left-aligned. Characters per line does not exceed 60. (5) between the output file, leaving only the word a space character, namely, the achievement extra spaces compressed. (6) the symbol @ indicates the text that follows it should be formatted in another paragraph emissions, first pa
Date : 2025-12-22 Size : 528kb User : 刘燕青

« 12 »