rtc

STM32F407罪行音频播放例程，好不容易找到的，经测试很好用。(STM32f407 audio example)

斐波那契堆基于二项式堆,在支持以O(1)时间实现插入、合并和以O(log n)实现删除最小元素的基础上，进一步实现了以O(1)实现指定节点值减少和用O(log n)时间完成删除任意节点操作(Fibonacci heap-based binomial heaps of support to the O (1) time to achieve insertion, Merger and O (log n) to achieve the smallest element deleted on the basis of further to the O (1) to achieve specified nodes and reduce the value of O (log n) time to complete the deletion of arbitrary nodes parade for)

说明：  DDE CLIENT,用于dde方式读区服务器内容(DDE Client for dde reading of server content)

检测NAT类型的客户端，程序中指定了服务器IP地址，用户可以自行修改(Detect NAT type of the client, the program specifies the server IP address, the user can modify)

用C++编写的单目视觉SLAM 图形化界面 VC++6.0环境(monoslam vc++ environment)

说明：  MFC实现多线程 简单端口扫描程序 能自定义线程数量及扫描端口范围(MFC simple multi threaded port scanner can scan a custom port number and scope of the thread)

mfc 各种曲线 chartdirect所有的例程，其中徐线动态库为破解版，支持英文，注释清楚(mfc various curves chartdirect all the routines, which Xu line dynamic library crack version, support for English)

设X[ 0 : n - 1]和Y[ 0 : n – 1 ]为两个数组，每个数组中含有n个已排好序的数。找出X和Y的2n个数的中位数。  编程任务 利用分治策略试设计一个O (log n)时间的算法求出这2n个数的中位数。 数据输入 由文件input.txt提供输入数据。文件的第1行中有1个正整数n（n<=200），表示每个数组有n个数。接下来的两行分别是X，Y数组的元素。结果输出 程序运行结束时，将计算出的中位数输出到文件output.txt中(Let X [0: n- 1] and Y [0: n- 1] for the two arrays, each array containing the n number has been sorted. 2n X and Y to identify the number of digits.  programming tasks using the divide and conquer strategy try to design an O (log n) time algorithm to calculate this median number 2n. Data input by the input data provided input.txt file. The first line in the file has a positive integer n (n < = 200), that there are n numbers of each array. The next two lines are the X, Y array elements. The end result is output program runs, the calculated median output to file output.txt)

运动会管理系统 运动会管理系统 (Games Management System Games Management System Games Management System)

基于“邻接点”概念，研究了最短路径的快速计算方法，并利用VB语言编写了计算所需的核心模块，最终实现了从一个节点到另一个节点的所有最短路径的快速查询和显示。(The best traveling line among many distribution nodes is searched by calculating the shortest path between two nodes based on basic principle of adjacency node, the core module is writted with VB, the shortest path from one node to the other node is quickly found and showed.)