这是一个电子钟程序,已经调试过,误差非常小,有用的朋友可以参照...

用C语言写的YABasic解释器，可以在Linux/windows等多个平台上运行-C YABasic written language interpreter, the Linux/windows etc. running on multiple platforms

这是我闲时无聊写的小游戏，完整的win32 GDI游戏教学。对新手很有用。包括游戏和地图编辑器。还有已经制作好的8个关卡地图文件。-This is my leisure to write silly little games, complete games win32 GDI teaching. Useful for the novice. Including games and map editor. There has produced a good 8 points map document.

棋盘信息无疑会快于90个字节的棋盘，但这并不意味着所有的运算和操作都会更快。使用32个字节的数据表示，程序员在确定一个棋子的位置时往往需要增加额外的移位操作以取出一个字节中含有的两个坐标信息。2.2 比特棋盘（BitBoards）随着计算机存储能力的大幅提高，棋盘表示的空间需求往往已不是设计人员最为关注的问题。-chessboard information will undoubtedly faster than 90 bytes of chessboard. But this does not mean that all arithmetic operations and will be faster. Using 32 bytes of data, programmers in determining the location of a piece often need additional shift operation to remove a byte containing the 2 Coordinate information. 2.2 bits chessboard (BitBoards) with the computer storage capacity substantially higher. The board said the demand for space is not often designers most concern.

一个可以用键盘的上下左右移动的飞机,并且带有颜色-One can use the keyboard up and down about the movement of aircraft, and with color

讲述了用proel进行电路板设计的具体流程，以及每一步的优化。-Proel carried out on the circuit board with the design of specific processes, as well as the optimization of each step.

本算法使用分治法求解最近点对问题。事先用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.

可实现双通道ad转换　四位数码管动态扫描-can achieve double-channel digital ad conversion of four dynamic scan

FFT 算法和功能测试，已经测试通过，可以直接使用-FFT

拯救小精灵，休闲游戏，有女朋友的注意了，特别适合女孩子玩，全屏游戏，下载后直接把后缀改为jar即可-rescue elf, leisure games, a girlfriend of attention, particularly for girls to play, full-screen games, After downloading directly to the suffix can jar

建模案例 建模案例 -Bird