服务器目录索引工具源代码

#包括；

一个处理数论的函数库，但是安装时有点麻烦，看看里面的介绍吧 -A deal with number theory library, but a bit of trouble during installation, look at the inside bar introduction

实现斐波那契算法的程序，程序中使用了递归操作，当然也可以使用其他方法来改进。-program to complete fibonacii

用vc开发快速Fourier变换原理及其应用实例源代码-Vc development with the principle of fast Fourier transform and its application source code

应用背景一） ；创建C：温度 struct_rect.dev并添加下面的源文件：：#包括

单片机89C52，郭天祥hl8051开发板通用，从2013年实验板以前基本通用，程序精简，效率高，简洁明了，注释清除  适合初学者学习，高手可以帮忙给改进按键部分。。谢谢

这是3 节点的AODV协议测试的源代码。欢迎大家下载、试用。谢谢大家的支持！希望有帮助！

Windows下的服务程序,一个server,一个client,server监听SOCKET-serve program in windows,a server ,a client , server listen socket

自作记事本，-for notebook, s

关于猎人过河问题 要解决这个问题就要使过河时载两个过河，返回时尽量只有一个回来。用一个字符串数组来存猎人，狼，羊，白菜；下标依次为0，1，2，3；但他们都有河这边和那边两种状态；为方便则定义一个结构，只含一个int型变量n；当在河这边时n设为0；在河那边时n设为1。由于每次过河与返回都要考虑狼能否吃羊或羊能否吃白菜；则需要一个函数来判断每次选择是否满足条件。-Hunters across the river on the issues to resolve this issue so we should cross the river when the two set out across the river to return to when there is only one back as far as possible. Using a string array to keep hunters, the wolf, sheep, and cabbage subscript followed by 0,1,2,3 but they have a river here and there two states To facilitate the definition of a structure containing only an int variable n When in the river here when n is set to 0 in the river when n is set to one side. Due to cross the river and return each time to consider whether the wolf can eat the sheep吃羊or cabbage you need a function to determine each choose whether or not to meet the conditions.