资源列表
排序选择:
C sharp 中对注册表的操作
- C sharp 中对注册表的操作 书籍语言: 简体中文 书籍类型: 程序设计 授权方式: 免费软件 书籍大小: 24 KB -C sharp for the operation of the registry books Language : English books categories : program design license : free software books Size : 24 KB
FontComboexex
- 很好用的字体下拉框,详情请看www.codeprject.com 有用的字体-good use of font drop-down box, the details please see www.codeprject.com useful font
8个软件
- 8个源码为jsp的文件。是我下载的,具体功能有一定的介绍,现需要本站上的一些程序希望能够采用。以后有钱了一定成为你门的VIP会员。不胜感谢-eight jsp source for the documents. Yes, I downloaded the specific function to a certain extent, is the site needs some procedures to adopt. After the money to a certain door you b
最小二乘法的曲线拟合
- 使用最小的二乘法实现对曲线的拟合。并输出最后的拟合曲线-use of the two smallest multiplication achieve the right curve fitting. And the final output curve
龙贝格算法
- 使用龙贝格算法对具体的函数进行规定次数的等分后最后求出在给定点的值-use Romberg algorithm to the specific function for the specified number of equally sought after in the final to the value of sentinel
字符匹配判断
- 给出串字符串作为模式串然后再输入你所要找的字符串-given string string as a model input strings and then you have to find the string
设计一个电子词典
- 一个电了词典,在里面可以查找到你所要的词 而且还可以自已加入更多的词-one -- the dictionary, you can try to be your word, but can also include more of their own words
去传世私服网
- 去传世私服网 ASP www.qwoool.com-to warehouses 1,500,000 net ASP www.qwoool.com
程序22
- 给定N个大小不等的圆C1,C2,…,现将这N个圆排进一个矩形框中,且要求个圆与矩形框的底边相切。圆排列问题要求从N个圆的所有排-given N ranging from the size of the circle C1, C2, ..., N now it is discharged into a round rectangular box, demanding 000 yen rectangular box with the bottom tangent. Yuan with the pro
youzi.cpp
- 给定N个大小不等的圆C1,C2,…,现将这N个圆排进一个矩形框中,且要求个圆与矩形框的底边相切。圆排列问题要求从N个圆的所有排-given N ranging from the size of the circle C1, C2, ..., N now it is discharged into a round rectangular box, demanding 000 yen rectangular box with the bottom tangent. Yuan with the pro
圆排列问题5
- 给定N个大小不等的圆C1,C2,…,现将这N个圆排进一个矩形框中,且要求个圆与矩形框的底边相切。圆排列问题要求从N个圆的所有排-given N ranging from the size of the circle C1, C2, ..., N now it is discharged into a round rectangular box, demanding 000 yen rectangular box with the bottom tangent. Yuan with the pro
图的m着色问题
- 给定无向量图G顶点和m种不同的颜色。用这些颜色为图G的各顶点着色,每个顶点着一种颜色。是否有一种着色法使G图中每条边的两个顶点着不同的颜色。这个问题是图的m可着色判定问题给定无向量图G顶点和m种不同的颜色。用这些颜色为图G的各顶点着色,每个顶点着一种颜色。是否有一种着色法使G图中每条边的两个顶点着不同的颜色。这个问题是图的m可着色判定问题-given no vector graph G vertices and m different colors. Using these color grap