example01

短信投票功能 短信猫

现有8升、5升、3升的容器各一个，均无任何度量标记，其中8升的容器装满油，其他两个为空。要求用上述容器倒来倒去，分成两份4升的油。（内附实验报告）(Existing eight liters, 5 liters, each a 3-liter container, no any measure mark, eight liter container filled with oil, the other two are empty. Requirements for the container shuffling back and forth, divided into two four liters of oil.)

说明：  伽马函数求解C语言，用来求解伽马函数的C语言 求解干嘛函数用的(The gama gan and de is gama you are )

说明：  呼叫阻塞率的计算和仿真：在时间轴上考虑。无论阻塞与否，下一呼叫到达时刻为当前呼叫到达时刻加上服从参数为1/λ的指数分布的呼叫间隔时间。一个呼叫到达时只需要判断呼叫的到达时刻和各个信道服务完成时刻的先后：如果前者比后者中任意一个大，说明至少有一个信道服务完成时刻比此呼叫到达时刻早，即此信道空闲，此时呼叫成功，应该先把此信道下一个服务完成时刻置为当前呼叫到达时刻，再加上服从参数为μ的指数分布的服务时间；反之，如果前者比后者中全部都小，说明所有信道在此呼叫到达后才会结束服务，即当前忙，此呼叫被阻塞掉了(call blocking probability calculation and simulation : the time frame to consider. Whether or not blocked, the next call arrived at the present moment to call time arrived with a subordinate parameters/ index distribution of the call interval. A call arrived only judgment call and the arrival time each channel service has completed a moment : If the former than the latter an arbitrary, and at least one channel is completed service calls than this moment arrived moments earlier, that this channel is idle, call this success, should first get here Channel a moment of complete services for the current call home arrival time, coupled with the parameters obey the exponential distribution services; Conversely, if the former than the latter, all small, with all the Channel call arrived only aft)

一个算法程序，根据输入内容自动生成编号，编号是有一定规则的(An algorithm for the procedure, according to input the content of automatically generated code, there is a certain number of rules are)

基于MFC框架实现了C均值聚类算法，感知器训练。(Based on the MFC framework implements the c-means clustering algorithm, perceptron training.)

自己实现字符串类，包括字符串的符号重载功能等，适合于C++初学者学习字符串的结构及C++的封装。(Achieve their own string class, including overloaded function symbol string, etc., suitable for beginners to learn the structure and C++ C++ package string.)

c语言圣经 中文版 C语言入门学习宝典(c language version of the C Language Introduction to the Bible to learn Chinese Collection)

实现可变分区的最坏适应算法来实现模拟系统对于内存的分配和回收的过程(Realizing the worst-fit algorithm of variable partition to simulate the process of memory allocation and recovery)

软件教程网，收集整理众多软件的使用教程，全站自动更新无需人工维护...(The software tutorials network, collected a number of software using the tutorial, the station automatically updated without manual maintenance ...)