2000/xp下消息发送器

《C＋＋程序设计教程》钱能 清华 习题原版答案全集 《C＋＋程序设计教程》钱能 清华 习题原版答案全集-" C++ Programming Tutorial" Money can be the answer Tsinghua Exercises original Complete Works of " C++ Programming Tutorial" Money can be the answer Tsinghua original Complete Works of Exercise

采用ic编写的handyboard机器人的中学组3号房间的程序,(2005年浙江省的规则)-used ic handyboard prepared by the robot on the 3rd secondary room procedures, (2005 Zhejiang Rules)

In the spirit of taking things too far, here is a fully functional 5-dimensional analogue of Rubik s cube.

火车车厢重排问题:给定一个任意的车厢排列次序。重新排列车厢，使其按照从1到n的次序排列。规定重排时只能从入轨到缓冲铁轨，或者从缓冲铁轨到出轨。-Train cars rearrangement problem: given an arbitrary compartment order of merit. Rearrange the cars, so that from 1 to n according to the order. Rearrangement can only be provided to the buffer from the orbit track, or tracks from the buffer to the derailment.

对链表分段的函数，使用链表的长度信息。其次要求把归并排序的每一步过程都打印出来。自己构造一个链表类并实现，用于排序。另外生成随机数的类-Section of the list function, use the length of the message list. Second, requested that the process every step of mergesort are printed. Construct their own class and implement a list for sorting. Another class of random number generation

Voronoi图 - 计算Voronoi图和Delaunay三角概要Voronoi图[-s-t]输出文件沃罗诺伊读取标准输入为一组点中的平面，要么写入Voronoi图和Delaunay三角到标准输出。每个输入行应该包含两个实数，用空格隔开。如果-t选项存在，Delaunay三角就产生了。每个输出线是三I J K这是在一个德洛奈三角形的三个点的索引。点编号从0开始。如果该选项不存在，Voronoi图产生。有四个输出的记录类型。是个B表示在输入点坐标LABC表明受= C与方程AX+线。 V A B表示一个顶点处A B。 Ë升V1 V2表示的Voronoi段这是行数l的子段;有编号的端点v1和v2。如果V1或V2是-1，则线延伸到无穷大。作者史蒂夫J.财富（1987）一Sweepline算法Voronoi图，Algorithmica2，153-174。

试验内容： 跳水比赛中运动员每完成一个跳水动作，都有J名裁判员为其打分，但每次总成绩中都要去掉一个最高分和一个最低分。每个运动员需要完成C个动作，每次动作结束都要按当前总成绩为全部运动员重新排序，结果在运动员出场比赛时显示出来。设总共有N个运动员参加比赛，其编号为1，2，… N。 编一个程序实现这一功能。 要求： 1、 建立一个*head为头结点的单链表 2、 以动作C为主循环，对每个动作输入每个运动员所有裁判打分。输入每个 运动员的所有打分后，立即对单链表按sum域(累计分)从小到大重新排序 3、 在每个动作之后，输出该单链表的所有结点-Note: Experimentation: When sportsman who taking part in diving game had finished each movement,there were J referees marking for sportsman,and each time the highest and lowest marks always were taken out. Each sportsman must finish C movements,no sooner did actions had be performed than current sum grades should be sorted and the final results should be displayed before athlete comes out. Supposing there are N athletes attending the game,the NO is 1,2,...N.Write an program to implement this fuction. Requires: 1 Create a single chain naming the name of headnode*head. 2 The movement C is main loop,Each sportsman s grades marked by all judges should be put in the each movement.After finished this,the

本程序通过x,y坐标的两次拉格朗日插值 实现非简单曲线的绘制 通过鼠标取点，简单易用-this program through x, y coordinates of the two Lagrange simple interpolation to achieve the curve by drawing from the mouse, easy to use

该程序关键在于Shell sort的实现： 缩小增量排序法 取整数d1,将所有距离为d1的倍数的元素为1组，在各组内排序。（每组内部插入排序） 取d2

相当不错的C++课件，过程化语句尽快掌握必备-Fairly good C++ Courseware, the process of statement as soon as possible the necessary