搜索资源列表
pingfang
- 求两个数的平方和的根,并且以窗口形式显示结果,sse-The number of squares and two seeking the root, and in the window display the results, sse
ROOT
- code想要的就自己下载 功能不强-code
BenvliMAXandMIN
- 这两个代码是用贝努利法求方程的最大实根和最小实根,方程只要是标准形式输入参数就可以调用此MATLAB函数-These two functions which are writtern by Matlab can solve out the max and min root through the Benvli method.
MyDictionary
- 自己写的一个java练习程序,可以根据输入的单词,查找出可能存在的词根。-Write a java practice their own program based on the input word to find out the possible existence of root.
boot
- 数根 数也有根吗?有!数根就是把一个数的各个数位上的值相加,直到得到一个一位数为止。请你编写一个程序来计算任意数N(0≤N≤1000000000000)的根。 输入: 输入有多个案例。每一个案例为一行,每行只有一个整数N。当输入的N是-1时,输入结束。 输出: 每一个案例输出一行。每行只有一个数字,就是N对应的数根。 Sample input 39 -1 Sample output 3-Number of root number als
diedai
- 迭代法求立方根的VB程序,初学者可能有用的着-Seeking cube root of the VB iterative procedure may be useful for the beginner
determine
- 判断一个图是否为树,并且相应的可以判断是否是根树,以及显示出树叶。-To determine whether a graph tree, and can determine whether the corresponding root tree, as well as the show leaves.
HelloAsp
- 1:建立一个网站,其中至少包括1个母版页、3个(以上)web窗体。在母版页中加入导航控件,用于方便地实现这组网页之间的跳转。 2:在网站中建立1个web窗体,实现文件的上传和下载功能。请先在网站根目录下建立一个子目录upload,将所有上传的文件保存在该子目录下,也从该子目录下选择文件进行下载。-1: Create a Web site, including at least one master page, three (or more) web form. In the master p
traverse_of_tree
- 树的三种遍历,先根输入,三种输出,简单好用!-Three kinds of tree traversal, first the root input, three output, easy to use!
99
- 開立方根 ,程式碼1為內建程式碼2為建表+二分搜尋-Open cube root, the code a code for the built-in 2+ 2 points for the construction of the table search
example3
- 分别建立命令文件和函数文件 转换想x,y的值 求一元二次方程的根-The establishment of a command file and function file Conversion to x, y values Seeking the root of one dollar a quadratic equation
bisection
- this program finds the roots of a polinomial which has real root by using the bi-section interpolation method.
xinwenkuaike
- 阅读新闻...添加一个阅读地址..就可以依次查看他的根节点很子节点.跟详细类容-Read the news ... to add a read address .. you can see him in turn is sub-root nodes. With the detailed Class Yung ..
v2.20-0247(06.09.13)AGanNo2.tar
- 兼容v2.20-0247的linux版本,内有源码,可编译(06.09.13)]AGanNo2 首先您需要去下载安装支持包libpcap和libnet 使用过程: 文件夹中包含的AGanNo2_0913在Linux 的2.6.15.3内核, libnet的版本1.1.2.1,libpcap的版本0.93下运行通过,如果在您的系统中不能运行,请试着重新编译编译! 编译过程: 1.解开源码包: tar -xvzf AGanNo2.tar.gz 2.编译: cd AGa
opc
- OPC的异步读取数据的类的封装。将opc的初始化,异步读取,同步读取,写,停止等功能封装到类中。使用的时候自己创建一个vc6项目,然后把压缩文件中的文件放到项目根目录,include头文件后就可以用了。-OPC asynchronous read data class package. The opc initialization, asynchronous read, synchronous read, write, and stop functions encapsulated into c
nwhois
- Designable domain query interface, and multi-query-mode supported Direct query root whois server for each domain extension. Query detailed domain whois information, but not brief provided by InterNIC Any domain extensions supported just by edi
addressbook
- 多人版的通讯簿,实现了:注册-登录-操作 的模式;用到了ACCESS数据库,可以显示记录登录记录 其中管理员的密码为:12345;注意要把数据库放到C盘的根目录下才可以使用-Multiplayer version of the address book, realized: Register- Login- operation mode use of the ACCESS database, you can display the record log records which the ad
moni
- 模拟病毒的自我复制和文件写入,运行后会在计算机所有硬盘根目录下生成该程序,在每个硬盘的根目录下面生成一个AutoRun.inf文件用于自动启动。-Simulated self-replicating virus, and documents written to run on a computer after all the hard disk root directory of the program is generated in each hard drive' s root dir
1
- 解方程a*x*x+b*x+c=0,输入a,b,c解出方程的根-Solution of equations a* x* x+ b* x+ c = 0, input a, b, c solved the root of equation
BST
- A Complete Binary Search Tree Program including insertion, deletion at root, leave or any node.