VC下最牛的算数表达式，将math.h 所有函数都集成到一起都能用计算出来，包括加减乘除；（、 正玄、 余玄,乘方，log ln,等...

GMP是计算任意精度的数学库, 包括支持整数,有理数和浮点. GMP包括大量的接口函数.-GMP is a free library for arbitrary precision arithmetic, operating on signed integers, rational numbers, and floating point numbers. There is no practical limit to the precision except the ones implied by the available memory in the machine GMP runs on. GMP has a rich set of functions, and the functions have a regular interface.

tempo 1 segundo，led 1赫兹，辅助频率；

设有n个人围做一圈，现从某个人开始报数，数到m的人出列，接着从出列的下一个人开始重新报数，数到m的人又出列，如此下去，直到所有人都出列为止。运用循环单链表解决约瑟夫环问题。- Is equipped with n personally to encircle makes, presently starts from some person to count off, leaves ranks the number to the m person, meets from the next person which leaves ranks is starting reto count off, leaves ranks the number to the m person, continue like this, all leaves ranks until all people. Using circulates Shan Lianbiao to solve the Joseph link problem.

资源描述数据结构、算法分析的一些程序编写，对初学者很有帮助，有助于加深理解进一步学习数据结构相关的内容。

vc++神经网络模式识别，还可以，对需要做这方面的人比较有用-vc neural network pattern recognition, but also to be done in this area were more useful

它是一个macra处理器程序 c 它执行一个macra处理器的所有基本功能。一次和两次macra处理器可以使用此实现的 b。你必须给一个包含宏指令的输入文件

聚类算法全集以及内附数据集，可以方便使用。-clustering algorithm and the Collected Works of containing data sets, it is convenient to use.

应用背景VB编写的简单验证码去除噪音VB编写的简单验证码去除噪音VB编写的简单验证码去除噪音VB编写的简单验证码去除噪音VB编写的简单验证码去除噪音关键技术VB6中利用中值滤波算法进行验证码椒盐噪音去除的源代码，就是速度慢，喜欢的就下载，适合新手

A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization.

基因比对算法其中一个算法代码。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。。