这个游戏是一个演示从cards.dll文件拔卡。我不是..

这是用VC+=编写的停机位飞机优化程序，这个程序的主要功能是计算出相邻飞机共用推出停止点的坐标，使得机场上飞机的推出点最优化

Engineer系统是降低服务器负载，减少企业运营成本的完美解决方案。通过动态批量生成静态页面，可使企业在对外发布服务器选择上，缩减对硬件的投资，并同时降低企业的互联网接入费用。-Engineer system is to reduce server load, reduce the cost of enterprise operations the perfect solution. Dynamic volume generated by static pages, allows companies announced the choice of server, reduced hardware investment, and at the same time reduce the cost of Internet access.

asp.net+sql sever 网络应用系统开发玉实例，中第一章实例。-Asp. Net sql sever network application systems development jade example, the first chapter examples.

用html编写的类似大富翁的游戏，包含所有源代码 -Html prepared using similar Monopoly game that contains all the source code

经典的通信系统仿真课件，基于Matlab平台实现通信系统各个环节的仿真-Classical communication system simulation courseware, based on Matlab platform communication system simulation of all aspects of

计算机图形学的讲义，简练的概括了图形变化基础知识-computer graphics lectures, concise summary of the changes in basic knowledge Graphics

一个转来的小车运动源程序 -Transferred to a source of car movement

一款图片转换小软件,比较实用，特别适合TGA转换-a picture converting tool

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

IAR EWARM 5.11.KEYGEN&ID.