还是用分支限界法解N皇后问题，已成功运行过。

一辆汽车加满油后可行驶n km，有若干加油站，设计有效地算法，指出应在那些站加油，是得加油次数最少-Fill up the car after driving an n km, there are a number of gas stations, design and effective method that should be in those refueling stations, is the least number of very filling

不同椭球坐标转化，54-84，统一椭球参数高斯正反算-Coordinate transformation ,54-84

gprom语言，ＴＭＢ真实移动床色谱模拟程序。-gprom language, TMB true moving bed chromatography simulation program.

斗地主的小游戏，可以与电脑进行对弈，程序比较简单。-Doude Zhu little game with computer chess, the program is simple.

一个图书销售管理的例子，使用access数据库，其中有编辑、更新、查找等功能，适合初学者下载学习。-An example of book sales management, using access databases, including editing, update, search and other functions, suitable for beginners to learn to download.

猜数字游戏 根据提示猜数字，可以选者难易程度-viewing game prompted viewing may select persons ease

通过参数设定，改变不同类型的整幅图像的亮度-scale the intensity of the input image

关于电影谍影重重的原著小说，英文版的，相信会对大家的英语水平有所提高。-谍影重重on the film

此程序实现了三个食人魔和三个传教士的过河问题，其中船上最多只能载两个人，船上和两岸的传教士数大于食人魔数传教士才是安全的-Realize this procedure three Ogre and three missionaries across the river, which can only be set on board a maximum of two people on board and on both sides of Ogre missionaries more than a few missionaries are safe

实现对INI文件的读写-realization of the right to read and write INI file