QTP9.2, very detailed, very detailed, very detailed, very detailed, very detaile...

《C语言大全》把国际著名C语言专家赫伯特希尔特（Herbert Schildt）的新作“C：The Complete Reference,Fourth Edition”介绍给广大读者！-err

是计算所买书籍的价钱，总共价钱的。输入单价和本数，则计算出总的价钱。-is calculated by the price of buying books, the total price. Input price and the number, then calculate the total price.

多功能计算器，不但实现基本运算器，还能实现相关公式的计算-Multi-function calculator, not only for basic computing device, but also achievement of the relevant formula for the calculation of

此文件详细地介绍c、c++函数集合，帮你深入理解vc-This document is a detailed introduction c, c++ Function set, to help you understand the depth vc

thinkjava java学习基础书籍-thinkjava java based learning books

用堆栈实现迷宫求解问题 基本思想: 若当前位置可以通过,则压入栈中,否则探求下一位置,若走不通,则回朔,迷宫大小:M*N.迷宫设置自定义。 求解迷宫问题的简单方法是：从入口出发，沿某一方向进行探索，若能走通，则继续向前走；否则沿原路返回，换一方向再进行探索，直到所有可能的通路都探索到为止。 为避免走回到已经进入的点（包括已在当前路径上的点和曾经在当前路径上的点），凡是进入过的点都应做上记号。-Maze with the stack to achieve the basic idea for solving the problem: If the current position can be adopted, in pressure, otherwise the next location to explore, if a dead end, then back to New Moon, the size of the maze: M* N. maze set up a custom. A simple maze to solve the problem is: starting from the entrance, along a certain direction to explore, can walk, then continue to move forward otherwise return along the same route, a direction for further exploration, until all possible pathways are exploring to date. In order to avoid going back to have access points (including the current path and current path in the point), all the points should be entered mark.

非c程序员c++入门自学教程-c c entry self-tutorial

学习C++的最好资料集合了很多前辈学习C++的经验和感受-Learning C++ The best data collection a lot of the older generation to learn C++

想投高质量的文章SCI,EI,通过这片资料可以对其有个大致的了解，对投稿很有帮助的-High-quality article would like to vote in SCI, EI, through this piece of information you can have a broad understanding, helpful for Authors

经典算法的完整可运行版。。非常有收藏价值-Classical algorithm can run the full version. . Very valuable for collection. . .