RTC涓流充电及后备时间计算器.mht格式

对工作分配进行多次优化，直到找到最优的分配方式。 首先将所有工作交给能力最强的人做，然后找出最低安全值和最高安全值，此时将未分配工作的人的能力值当作安全值参与判断，把安全值最低者分配的仓库数减一，并将这个仓库交给安全值最高者看守，然后进入下次优化，在新一次优化过程中把最低安全值和上次优化时的最低安全值作比较，如果这次最低安全值比上次大，则继续进行优化，若系统最低安全值相比上次下降，则说明上次优化后的结果已经是最优，即得结果。-work on a number of distribution optimization, until they found the optimal method of distribution. First of all to the most capable people to do and then find the minimum value and maximum security safety value has been assigned to this work of the human capacity as a safety value in judging the value safety, the lowest value of the distribution by a few warehouses and storage to the value of the highest security guards, and then proceed to the next optimization of the new optimization process a minimum safe value and optimization of the last minimum safety value for comparison, if the value of the last minimum security, will continue to optimize, if the minimum safety systems compared to the previous decline in value, a statement last optimize the result is optimal, that i

motorola s_record格式文件和二进制bin格式文件之间的相互转换算法-motorola s_record format bin files and binary files between the conversion algorithm

读取wave文件数据播放并显示波形图，其中分单声道跟双声道。开始要有过滤处理-Play wave file data read and display the waveform diagram, in which with the dual-channel mono. Filtration treatment must be started

c++模板应用。。 。。 。。。 -vc

移动固定资产管理 基于WINDOWS MOBILE平台-Mobile fixed assets management platform based on WINDOWS MOBILE

刻录快方便简单我很喜欢用可以个就啊好 -ds

VC和DX编写的一个横版卷轴格斗游戏 我的作品不多 全传上来了,刚刚好:)-VC and the preparation of the DX version of a horizontal scroll fighting games my work onto small Biography, just right :)

Assume that Edison has found himself in a square-shaped maze of NxN square cells which is surrounded by walls from the outside. In the maze, some of the cells are also walls. Edison can only move between two empty cells in four directions, north, south, west and east. In order to get out of the maze, he drafts a plan. He uses his left hand to lean on the wall and goes by following the wall. Here is the question, is Edison able to get out of the maze in at most 10,000 steps? If he can make it, output the path. By getting out of the maze, he only needs to be in the exit cell. If the starting cell is the same as the exit, Edison won"t need to move and can directly get out of the maze. Input The first line of the input gives the number of test cases, T. T test cases follow. Each test case starts with an integer N. N is the size of the maze. Th

一维fdtdMATLAB程序，主要用于处理问题电磁场-FdtdMATLAB one-dimensional process, is mainly used to deal with the issue of electromagnetic fields