用vc＋＋实现的基于面向对象的三维积木源代码。简单易懂

解压后 每个.cpp都有中文名很清楚。我是初学者，都是我的作业。会不断添加。- After the decompression each cpp all has Chinese name to be very clear. I am a beginner, all is my work. Can unceasingly increase.

修改过去混沌算法中的参数选择问题,使算法变得更准确.-Modified over the past chaotic algorithm parameter selection problem, so that algorithms become more accurate.

用c写的关于8255按键的程序,用到的单片机是spce061a -With c written procedures on the 8255 button, single-chip microcomputer is used SPCE061A

一个阳历转阴历的程序 一个阳历阴历日期转换的程序-A solar calendar of the proceedings to a solar calendar lunar calendar lunar calendar date conversion procedure

zju 1756,比较简单-zju 1756, relatively simple

通讯协议，视频、会议电视采用的主流通讯协议，目前在NGN中广泛应用-communications protocols, video, television meeting the mainstream communications protocols, in the widespread application of NGN

相移波束形成仿真程序,用24个阵元仿真,形成181个波束,适用于水声信号处理里的波束形成技术-Phase-shift beamforming simulation program, using 24 array element simulation, the formation of 181-beam, applied to underwater acoustic signal processing in the beam-forming technology

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

转载c++例子，是一个关于文件系统管理的代码，可以下来-reproduced example is a file system on the management of code can look down

本压缩包是上一个“生成字模”的程序所需要的两个动态链接库，使免费下载的。-the compressed package is a "generation Fonts" process required two dynamic link library, a free download.