我的工作是 Delphi 程序员

这是书上的关于24点游戏的代码，就是4张扑克牌用加减乘除凑24的游戏，VC编的，希望对大家有帮助-This is a book on the 24-point game of the code, that is, four cards together with calculation of 24 games, VC series, and they hope to help everyone

图像处理的必备源码-image processing essential source

翻译 maninwest@Codeforge作者:Yvan Rodrigues@CodeProject 使用代码 using System; using System.Windows.Forms; namespace RedCell.App.Calculator.Example { public partial class Form1 : Form { private double accumulator = 0; private char lastOperation; public Form1() { InitializeComponent(); } private void Operator_Pressed(object sender, EventArgs e) { // An operator was pressed; perform the last operation and store the new operator. char operation = (sender as Button).Text[0];

这一项目使学生投票学校组织的领袖。 它可以方便地进行操作与 sql 的连接

读取DWG、DXF文件,并把DWG、DXF图显示到界面。-Read DWG, DXF files, and to DWG, DXF diagram shows the interface.

ATM系统部分代码．第一用JAVA写的代码．调试了下．．可以运行．．不过只是部分的代码．．没有都发上来-ATM system, part of the code. First used to write JAVA code. Debugging the next. . Can run. . But only part of the code. . Did not have hair up

一凸8 边形P 的顶点顺时针为{v1，v2，… ，v8}，任意两顶点间的线段的权重由矩阵D 给出。 若vi 与vj 是P 上不相邻的两个顶点，则线段vivj 称为P 的一条弦。求P 的一个弦的集合T， 使得T 中所有的弦恰好将P 分割成互不重迭的三角形，且各三角形的权重之和为最小（一 个三角形的权重是其各边的权重之和）。-A convex 8-gon P, vertex clockwise of (v1, v2, ..., v8), any two vertices of the segment between the weight given by the matrix D. If vi and vj is the P is not adjacent to two vertices, then the line segment vivj known as P, a string. Seeking P, a set of strings T, makes the T all the strings just to P divided into non-overlapping triangles, and the weight of each triangle and for the minimum (the weight of a triangle is its weight of each side and) .

获得本机ip地址，网络编程-to this machine ip address, Network Programming

许多基础实用的C++源码，适合初学者使用，如递归反转字符串-Lot of basic practical C++ source code, suitable for beginners to use, such as recursive string inversion. . . . .

快速信息化系统开发框架V4.1，C#开发的平台，可以快速二次开发