说明： /汉诺塔递归算法过程解析: //汉诺塔（又称河内塔）问题是印度的一个古老的传说。开天辟地的神勃拉玛在一个庙里留下了三根金刚石 //的棒，第一根上面套着64个圆的金片，最大的一个在底下，其余一个比一个小，依次叠上去，庙里的众僧 //不倦地把它们一个个地从这根棒搬到另一根棒上，规定可利用中间的一根棒作为帮助，但每次只能搬一个， //而且大的不能放在小的上面。解答结果请自己运行计算，程序见尾部。面对庞大的数字(移动圆片的次数) //18446744073709551615，看来，众僧们耗尽毕生精力也不可能完成金片的移动。 //后来，这个传说就演变为汉诺塔游戏:(err)
说明： 瑞士某大学编写的著名计算有限元程序Z-Soil的面向对象语言版的(Swiss University, prepared a well-known finite element program calculated Z-Soil of the object-oriented language version of the)
说明： 这个小工具可以实现浮点数（4个字节）和实数之间的转换。(This gadget can achieve floating-point numbers (4 bytes) and the conversion between real numbers.)
说明： 迷宫程序，不是很好看，不过适合初学者。用VC++编写的，看看吧。(Maze procedure, not a good look, but suitable for beginners. With VC++ Prepared to see it.)
说明： 用c语言实现电机仿真－基于恒定磁链的转子磁链控制。(Using c language realize electrical simulation- based on a constant flux of the rotor flux control.)
说明： 用c++写的一个程序，可以用来设置2组ip，并且迅速的在两个ip之间切换，以实现不同ip的转化。(With c++ Write a procedure that can be used to set up 2 ip, and quickly switch between the two ip in order to achieve the transformation of a different ip.)
Michael喜欢滑雪百这并不奇怪， 因为滑雪的确很刺激。可是为了获得速度，滑的区域必须向 下倾斜，而且当你滑到坡底，你不得不再次走上坡或者等待升降机来载你。Michael想知道在一 个区域中最长的滑坡。区域由一个二维数组给出。数组的每个数字代表点的高度。 (Michael likes to ski hundred This is not surprising, because the skiing is very stimulating indeed. However, in order to obtain speed, Waterloo regional must be downward-sloping, and when you slide into the base, you have to embark once again on the slope or to set you waiting for lifts. Michael would like to know the longest in a landslide area. Region is given by a two-dimensional array. Each figure represents an array of high points.)
一个反褶积的VC++例子,简单明了,很适合刚刚开始学习信号分析的人(A deconvolution of VC++ Example simple, it is suitable for signal analysis has just begun to study people)
用于启动界面的制作，以及对于词法的分析，很实用的东西(Interface used to start production, as well as for lexical analysis, a very practical things)
调用会出现一个功能界面计算器,通过它你可以来计算一些加减乘除运算.(There will be a function call interface calculator, which you can calculate a number of addition and subtraction to multiplication and division calculations.)
c和c++动态数组的实现.visual studio 2008下编译通过(c and c++ realize dynamic array. visual studio 2008 under the compiler through)
针对水轮机调节系统PID参数辨识问题，作者在VC++6.0环境下，使用c语言，编写PID参数参数辨识程序，结果表明，该程序能够辨识出Kp,Ki,Kd三个参数，满足调节系统的误差要求。(Turbine regulating system for PID parameter identification problem, the authors VC++ 6.0 environment, using c language, the preparation of PID parameters of parameter identification procedures, results show that the program can identify Kp, Ki, Kd three parameters to meet conditioning systems error requirements.)
一个C程序：以便在购书籍量超过5本并且购买总额超过500元时，提供15％的折扣。接受用户输入书籍数量及购买总额，并显示最终应付总额。(A C procedure: in order to purchase books in quantity more than 5 and the total amount of the purchase of more than 500 yuan to provide 15 discount. Accept user input and purchase the total number of books and displays the total amount of the final meet.)
用VC操作EXCEL的方法，生成了一个excel表格(EXCEL using VC operation method to generate a excel form)
利用FT245BM USB模块做的虚拟示波器，暂时可以达到1M的速率！(FT245BM USB modules make use of a virtual oscilloscope, the time being can achieve a rate of 1M!)
这是一个日期查询系统，它的功能有：判断闰年，查询星期功能。(This is a date inquiry system, its functions are: to determine leap year, query functionality weeks.)
大型CFD源程序DUNS，求威望 介绍： Diagonalized ADI Navier-Stokes (DUNS) Code The DUNS code is a 2d/3d, structured, multi-block, multi-species, unsteady or steady, Navier Stokes fluid dynamics code with the q-omega turbulence model. It is configurable on several different levels allowing you to make the code as general or as efficient as you desire. It has been developed on Linux, Cray, RISC6000 and to a lesser extent SGI and HP architectures. It is written in FORTRAN-77 and C. It has been used primarily as a research code, and because of that, the coding can be at times rather undocumented and unclear.(Large-scale CFD source DUNS, seeking prestige Introduction: Diagonalized ADI Navier-Stokes (DUNS) CodeThe DUNS code is a 2d/3d, structured, multi-block, multi-species, unsteady or steady, Navier Stokes fluid dynamics code with the q- omega turbulence model. It is configurable on several different levels allowing you to make the codeas general or as efficient as you desire. It has been developed on Linux, Cray, RISC6000 and to a lesser extent SGI and HP architectures. It is written in FORTRAN-77 and C. It has been used primarily as a researchcode, and because of that, the coding can be at times rather undocumentedand unclear.)
编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)
本站资源：696518 个
本站会员：104225 个
总计下载：492399 次
今日上传：0 个
Copyright© 2019-2024 |
Powered by Imdn
|
浙ICP备16007336号
|
|
联系客服（QQ：3324461878）
本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！
