基于对话框的计算器，实现了基本的加、减、乘除四则运算

网上收集的常用pragma指令的用法，对于使用其他c++库很值得学习-Online collection of common usage of pragma directives for the use of other c++ Library is worth learning

Loads an 3d object from Gmax or 3d studio max into opengl Loads an 3d object from Gmax or 3d studio max into opengl Loads an 3d object from Gmax or 3d studio max into opengl-Loads an 3d object from Gmax or 3d studio max into opengl Loads an 3d object from Gmax or 3d studio max into opengl Loads an 3d object from Gmax or 3d studio max into opengl Loads an 3d object from Gmax or 3d studio max into opengl

本文档的目的在于阐述一种方法，通过该方法，开发小组可以在他们所编写的代码中保持一贯的风格。这样做的目的是使在开发小组中的每一个程序员都可以明白其他程序员的代码。这有助于提高代码编写的可读性和使用的一贯性。-This document aims to set out a way through this method, the development team can be prepared in their code to maintain a consistent style. The aim is to enable the development teams in each of the programmers can understand other programmers code. This helps to improve code readability and use of the preparation of consistency.

转载只是说明该程序很高-reproduced only to illustrate the procedure high

采用bezier算法画曲线，控制点用键盘输入的方法进行设置-Painting algorithm using Bezier curves, control points using the method of keyboard input settings

visualstudio2005用VB编写的ImageWithTransparency源代码

K r u s k a l算法每次选择n- 1条边，所使用的贪婪准则是：从剩下的 边中选择一条不会产生环路的具有最小耗费的边加入已选择的边的集合中。注意到所选 取的边若产生环路则不可能形成一棵生成树。K r u s k a l算法分e 步，其中e 是网络中 边的数目。按耗费递增的顺序来考虑这e 条边，每次考虑一条边。当考虑某条边时，若将其 加入到已选边的集合中会出现环路，则将其抛弃，否则，将它选入。-K ruskal algorithm for each choice of n-1 edges, the greed of the criteria used are: from the left edge select does not produce a loop with the smallest cost edge has been selected to join the edge of the collection. Taking note of the selected edges have a loop if it can not form a spanning tree. K ruskal algorithm sub-e-step, in which e is the number of network edge. According to the order of incremental cost to consider this e edges, each taking a side. When considering a certain edge when, if its added to a collection of selected edge loop will appear, will be its discarded, otherwise, it selected.

设Internet上有N个站点，通常从一个站点发送消息给其他N－1个站点，需依次发送N－1次。 这样从一个站点发布消息传遍N个站点时，可能要较长时间。 设从每一个站点都可以向其他N－1个站点同时发送消息. 当一个站点发布消息给若干个站点后, 设为k个, 已获得消息的这1+k个站点就可以同时发布消息给另外若干个站点, 设为t个, 此后就有 1+k+t 个站点可以同时发布消息，这种发布消息方法应该会缩短消息传遍N个站点的时间。 请您编一个程序, 编程求出从第一个站点开始发布消息传遍N个站点的最短时间。

纯C的画笔源程序，调用底层的汇编命令控制鼠标和屏幕，模拟消息循环机制，是学习C/C++不可多得的例子。我当年可是用这个得了图形学满分的啊！-pure C source of the brush, called bottom of the compilation order to control the mouse and screen, simulated news cycle mechanism, it is learning C/C rare examples. But then I had with the graphics out of ah!

本程序适用于将离散点云数据（.txt），转换为IGS格式-this procedure will be applied to discrete point cloud data (. Txt), format conversion of IGS