搜索资源列表
yuesefu.doc1
- 约瑟夫问题的一种描述为：编号为1，2，…，m的m个人按顺时针方向围坐一圈，每个人持有一个密码（正整数）。一开始任选一个正整数作为报数的上限值n。从第一个人开始按顺时针方向自1开始顺序报数，报到n时停止报数。报n的人出列，将他的密码作为新的n值，从他在顺序方向上的下一个人开始重新从1开始报数，如此下去，直到所有的人都出列。-a problem described as : No. 1, 2, ..., m m by individuals sitting around a circle clock
Doc1
- yep Visual C++ Books Java Books Delphi-C++Builder software engineering Certification book Other Books Document [Expand all] [Recomment to add directory] (Important) Why your files are not be used? 1.The content is too simp
doc1
- hi this the document for help
Doc1
- This aprroximately completed funriture managment systemm this is built in c# and need some upgradations. i have placed all the source code in it-This is aprroximately completed funriture managment systemm this is built in c# and need some upgradation
Doc1
- command line code for confiuring DHCP commands of Router
full-doc1
- full project documentation for it base student
Doc1
- this is new approach for fuel cell control.it is really helpfull.