1213

用动态规划法求解旅行商问题 已经加入注释 欢迎批评指正(dynamic programming method for the traveling salesman problem has joined Notes welcome criticism correction)

ghOst远控1.0源码，相比于3.6更稳定，视频超快。(ghOst Remote Control 1.0 source code, compared to 3.6 more stable, ultra-fast video.)

队列的顺序定义，队列的调用算法等，队列的模板类及其实现(Defined in the order queue, queue calls algorithm, queue template class and its implementation)

以前没外放的天域版本远控. 特别稀少. (Not previously extroverted Tamrac version remote control. Particularly scarce.)

说明：  贰叁伍远控 服务器版，支持win7，win10，win8 等上线 最新免杀 时间：20190519 过金山，腾讯管家，火绒杀毒等杀软(Bian Sanwu remote control server version, support win7, win10, win8 and other online The latest free time: 20190519 over Jinshan, Tencent housekeeper, flannel antivirus and other soft killing)

红河谷邀请码生成器(2010年7月28日测试通过)(hong he gu yao qing ma sheng cheng qi)

利用二维数组创建杨辉三角形，基于vc++程序设计(Creating a Yang Hui triangle by using a two-dimensional array .Programming based on vc++)

VB采用UDP远程唤醒主机一例,有需要的就下。(VB uses UDP remote wakeup host one case, there is a need on the next.)

设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)

养鸡远控源码 仅下载功能 修复了 大量 BUG 基于ghost 3.6 内核 修改的噢 稳定性 我就不说了吧 (Chicken remote control source download function only fixes a lot of bugs based the ghost 3.6 kernel modifications Oh stability I will not say it)