另一个版本的x264的decoder，里面改进了bS的输出

控制台小游戏,角类,玩家和NPC共用的类,主要有两个函数,一个是初始化,一个是升级-Game console, corner type, the player and NPC share class has two main functions, one is initialized, one is to upgrade

采用C++对Ioctl接口进行二次封装。封装目的就是使用简洁化，统一化

draw canvas

数字电子技术电子教案-note at least eight characters, extracting passwords to note Password

本算法使用分治法求解最近点对问题。事先用O(nlogn)时间对x坐标进行排序，使得所有的点是按x坐标从小到大排好序的（x坐标相同时y坐标小的排前），然后取下标小于n/2属于左边的点集PL，取下标大于n/2属于右边的点集PR，即用O(1)时间就可以将规模为n的问题分解为两个规模为n/2的、同类型的子问题。分割完毕之后就可以采用分治法，分别求出PL和PR中的最近点对，最终通过递归实现。-This algorithm uses divide and conquer to solve the problem closest point. Prior to use O (nlogn) time to sort the x coordinate so that all points are based on x coordinates from small to large sorted (x coordinates with the same y coordinates of the small, the top), and then remove the standard is less than n/2 the set of points belonging to the left PL, remove the standard is greater than n/2 set of points belonging to the right of PR, that is to use O (1) time can be the problem size n divided into two size n/2, the same type The sub-problems. Segmentation can be used after completion of sub-rule method, respectively, find the PL and PR in the last points and eventually through the recursion.

中国农历的小程序，和阳历明显区分开来！是实现阴，阳历转换的不错代码实现-Chinese Lunar small procedures, and a clear distinction between the solar calendar! Yin is, after conversion to achieve good code

某市住房公积金管理中心系统，很好的数据库！提供给大家参考！-city housing provident fund management center, a good database! Provide for your reference!

给四个玩家分发桥牌,每人13张牌，使用Random实现，不会出现重复-deal pokes to four player

迷宫探险游戏是一个在turboC2环境下编写的小游戏，该游戏是根据DxBall撞球游戏进行设计的具有简单的撞球功能的游戏-maze is an adventure game in turboC2 environment prepared by the small games, the game is based DxBall balls for the design of the game is simple function of the pool games. .

用C语言实现进程调度－操作系统课程设计设计思想： “最高优先数优先”调度算法的基本思想是把cpu分配给就绪队列中优先数最高的进程。采用动态优先数，即优先数在创建进程时给定一个初始值，当进程获得一次cpu后其优先数就减少1。-C language scheduling process-design courses on operating system design : "Priority number of the highest priority" scheduling algorithm the basic idea is cpu allocated to the parade were in place the highest priority in the process. Dynamic priority, which is priority number in the creation process to set an initial value, When the process is a cpu after its priority on reducing the number of one.