-
是一本介绍tuxdo书籍，是一本很好的入门
是一本介绍TUXDO的书籍，是一本很好入门级的书籍。-Is an introduction TUXDO books, is a good entry-level books.
- 2022-03-03 00:49:44下载
- 积分：1
-
为了安装DotNetNuke和支撑数据库，你需要Wi…
In order to install DotNetNuke and a supporting database you will need either Windows 2003 Server or
Windows XP (development only). This book covers a basic install of DotNetNuke using a SQL Server
database as the Data Provider. You will need to have access to either SQL Server 2000 or MSDE (develop-
ment only) on the same machine or a remote machine.
To participate in the development chapters, you will need Visual Studio .NET 2003.
- 2022-10-16 00:30:04下载
- 积分：1
-
ASP.NET网络书店
ASP.NET网络书店-ASP.NET network Bookstore
- 2022-03-15 11:37:16下载
- 积分：1
-
介绍概率论基础和随机过程的电子书，前三章为概率内容，后三章为随机过程。...
介绍概率论基础和随机过程的电子书，前三章为概率内容，后三章为随机过程。-Introduce the basis of probability theory and random process of e-books, three chapters for the probability content, after the chapters for the random process.
- 2022-07-21 03:22:57下载
- 积分：1
-
electronic version of VC to study, the book is divided into 14 chapters covering...
电子版VC++ 学习用书,本书共分14章基本上含盖了VC的整个方面,可用于学习或参考-electronic version of VC to study, the book is divided into 14 chapters covering basically the entire VC, can be used to study or reference
- 2023-08-26 08:40:03下载
- 积分：1
-
连续邮资算法的理论研究文章，值得仔细看看。
连续邮资算法的理论研究文章，值得仔细看看。-The theory of continuous postage algorithm research articles, it is worth a closer look.
- 2022-01-23 11:03:08下载
- 积分：1
-
CSS Chinese Manual Chinese Manual CSS Chinese Manual CSS
CSS中文手册 CSS中文手册-CSS Chinese Manual Chinese Manual CSS Chinese Manual CSS
- 2023-04-25 15:30:03下载
- 积分：1
-
二叉树的数据结构，遍历搜索，对初学者很有帮助
数据结构中binarytree 遍历及查找,对初学者很有帮助 -Binarytree data structure traversal and search, very helpful for beginners
- 2023-07-08 10:30:04下载
- 积分：1
-
松下相机的AC电源适配器电路原理图松下相机交流适配器…
松下摄像机交流适配器电路原理图
松下摄像机交流适配器电路原理图-Panasonic Camera AC adapter circuit schematic diagram Panasonic Camera AC adapter circuit schematic
- 2023-05-21 07:55:03下载
- 积分：1
-
约瑟夫（Joeph）问题的一种描述是：编号为1,2,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一...
约瑟夫（Joeph）问题的一种描述是：编号为1,2,…,n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始顺序报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向上的下一个人开始重新从1报数，如此下去，直至所有人全部出列为止。试设计一个程序求出出列顺序。-Joseph (Joeph) a description of the problem is: numbered 1,2, ..., n, n individuals sitting clockwise circle, each holding a password (positive integer). An optional start a positive integer as the number of reported upper limit of m, from the first person to embark on the clockwise direction starting from a reported sequence number, to report the number of m stop reported. Those who reported m out of the column, his password as the new m value, from his home in a clockwise direction on the next person started to re-reported from a few, and so on, until all of the column until all the up. Try a program designed to find out the column order.
- 2022-08-14 04:29:17下载
- 积分：1
