以前的操作系统作业

用回溯法求解KnightTour问题 【KnightTour问题】在一个8×8的棋盘上，检验以某一位置作为出发点的棋子能否遍历一次棋盘上的所有棋格，且最后回到出发点。（备注：棋子每次只能沿东、南、西、北、东南、西南、东北、西北方向走一步！！)-Method with back issues KnightTour】 【KnightTour issues in a 8 × 8 chessboard, the examination for the position as the starting point of a piece of a chessboard can traverse all the chess grid, and the final return to the starting point. (Note: each piece can only be along the east, south, west, north, southeast, southwest, northeast, northwest direction step!!)

ADC function very good please pass ok but it is too short

easy algorithm to 3d representation, and example of plotter vector fields.-easy algorithm to 3d representation, and example of plotter vector fields.

爱视网影视收费系统-love as network television system

一个关于开方的c++源代码，自己没事写的，希望大家看看相互学习-On the prescription of a c++ source code that he wrote nothing, and hope that we see and learn from each other

this Program can get memory information,is good

模拟网页发送表单，用套接字把表单发送到服务器，模拟51网站登录-Simulation web form to send with the form sent to the server socket, analog 51 Web Log

算法内容：首先将二维灰度图像抽象为三维地形，横纵坐标表示经纬度，灰度表示高度，这样就产生了一个地形图，地形中有高山有盆地，我们的任务就是找到盆地并且给盆地划定地盘。  算法过程，将最低点（灰度）作为起始点，开始从下注水，想泉水一样，水位逐渐上升，所有点都是上下透水的，但不会横向流动，每产生一个新的积水盆地时标记这个盆地使之与原有盆地区别开，当两个盆地内的水要汇集的时候，在此点建立一个水坝，将水分开，此水坝无限高，水永远不会溢出，依次建立所有水坝，最后的水坝就是所谓的分水岭或分水线，也就是得到的分割线。 

使用wavein 录音程序 开始停止播放 MFC dalog 

vb.net编写的 人员管理系统.rar 带数据库 要下得快-vb.net prepared by the personnel management system. Rar with database to the next faster