登录
首页 » C++ Builder » guanya

guanya

于 2011-12-24 发布 文件大小:814KB
0 73
下载积分: 1 下载次数: 2

代码说明:

  noip2010第三题关押罪犯...写得巨丑 只为上传...(noip2010 the third problem.it s very ugly....)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • dazhengshu
    找最大整数找最大整数找最大整数找最大整数找最大整数(To find the largest integer to find the largest integer to find the largest integer to find the largest integer to find the largest integer)
    2010-01-02 12:53:42下载
    积分:1
  • Kruskal
    Kruskal in Data structure
    2013-10-02 21:20:46下载
    积分:1
  • xianxingbiaolianjie
    线性表的链接实现可利用单链表来实现,每个节点存储一个元素。 利用单链表来实现线性表的元素的插入,删除,修改等功能。 (Linear link table can be used to achieve a single linked list to implement, each node stores an element. Using a single linked list to implement elements of the linear table insert, delete, modify, and other functions.)
    2011-04-26 11:57:25下载
    积分:1
  • HuffanCoding
    读取数据,统计所得到的文件中每个字母的权值,创建哈夫曼树,哈夫曼编码。哈夫曼解码,解码后内容写入到指定的文件。 读取数据里面的内容是由英文单词组成。读取文件的时候传入文件存放的路径、读取方式以及读出以后存放的数组,最终可以得到一个存放目标文件内容的数组。 将得到的数组进行字母权值的统计,统计每个字母出现的次数,次数即为每个字母的权值。 将得到的字符数组与权值数组作为创建哈夫曼树的依据,哈夫曼树根据每个字母权值的大小来创建,每个节点,包括权值、父节点、左子、右子和字母本身。 根据哈夫曼树进行编码。形成目标文件的哈夫曼编码,将此编码返回。 根据哈夫曼树得到的数组即为解码数组,解码数组作为解码的结果返回。 写入输出文件,将解码得到的数组、文件的完整路径以及文件的写方式作为参数传入,将数组写入到相应的文件中。 (Read the data, statistical documents obtained weights for each letter, create a Huffman tree, Huffman coding. Huffman decoding, the decoded contents are written to the specified file. Read the content inside is composed of English words. When the incoming file to read the file storage path, read mode and read out after storage array that can eventually get a storage target file contents of the array. The resulting array of letter weights statistics, statistical number of occurrences of each letter, the number is the weight of each letter. The resulting character array with the weights array as the basis for creating Huffman tree, Huffman tree based on the size of the weights of each letter to create, for each node, including weights, parent, left child, right child, and letter itself. According to Huffman coding. The formation of the target file Huffman coding, this code returns. According to Huffman decoding the resulting array is an array, the decoder decodes the result is retur)
    2020-07-02 15:40:01下载
    积分:1
  • Bitree
    二叉树的打包数据结构,包括遍历,删除,添加,注释详细(Packaged binary tree data structure, including traversal, delete, add, annotate details)
    2015-10-04 23:44:33下载
    积分:1
  • c_list
    c语言链表,需要的时候可以方便大家使用,仅供参考(c language, and when required, we can easily use for reference purposes only)
    2007-02-26 10:33:04下载
    积分:1
  • text
    输入N个点的坐标,判断这N个点能否构成一个凸多边形。(Enter the coordinates of N points, to determine whether the N points form a convex polygon.)
    2011-12-13 09:43:42下载
    积分:1
  • Data_Struction_prim_MST
    说明:  数据结构作业代码。 最小生成树 Prim实现。 win32 Console界面。(operation code data structure. Prim achieve the minimum spanning tree. Win32 Console interface.)
    2006-04-08 08:50:52下载
    积分:1
  • NandFlash-FTL
    详细描述了NandFlash驱动FTL层的概念及数据结构,详细描述了地址映及其他方面的内容,还提供了几篇有价值的参考论文,值得学习。(A detailed description of the concept of layers NandFlash FTL drive and data structures, a detailed description of the address mapping and other aspects, it also provides several valuable reference papers, it is worth learning.)
    2020-12-26 12:59:04下载
    积分:1
  • Hanoi
    简单的汉诺塔算法,采用归约算法的思想,实例是三个盘子,三个柱子(Simple HANOR algorithm)
    2012-07-16 20:48:59下载
    积分:1
  • 696524资源总数
  • 103945会员总数
  • 46今日下载