搜索资源列表
约瑟夫环数据结构实验报告
- C语言数据结构课程设计约瑟夫环1． 本演示程序中，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止。-C language curriculum design data structure Joseph Central 1. The demo program, the number of n for arbitrary, and the first to be assigned to
migong.rar
- 以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。,M* n in a square, said the maze of long, 0 and 1, respectively, in the maze of pathways and barriers. Design a procedure, the maze of arbitrary, derived from the entrance to a
PDATEST
- 为Symbol MC70编写的条码扫描程序.能识别二维码,一维码,可以设置条码分割字符.用于Symbol扫描枪开发测试.查看代码前请自行安装symbol开发类库EMDK-M-020403.exe-Written for the Symbol MC70 barcode scanner. Able to identify two-dimensional code, one-dimensional code, you can set the bar code character segmentatio
ewe3e
- c#进度条的使用，还有读取txt文件第m行n列飞方法等等吧，三个程序的源代码，和大家分享下。-c# progress bar to use, as well as read the txt file first m rows n columns, so it fly method, three program' s source code, and share with you.
Statistical-letters-number
- Descr iption: 给定一段文章，请输出每个字母出现的次数。 Input: 只有一组输入数据，该数据大小<10KB。 在文章中除最后一个字符外，只有小写字母、空格和换行符，没有另外的标点、数字和大写字母等。该文章以’#’结尾。 Output: 输出格式为“C A”，C为’a’..’z’中的字母，A为出现次数，C和A之间空一格。 Sample Input: here is the input this is the article
yundonghui
- 运动会开了N天，一共发出金牌M枚。第一天发金牌1枚加剩下的七分之一枚，第二天发金牌2枚加剩下的七分之一枚，第3天发金牌3枚加剩下的七分之一枚，以后每天都照此办理。到了第N天刚好还有金牌N枚，到此金牌全部发完。编程求N和M。-The Games opened a N days, issued a total of gold medals M missiles. The first day of hair gold medal-sevenths of a 1 plus the rest of the
CLanguage
- Giáo trình C# hay, mong mọ i ngư ờ i ủ ng hộ , chúc mọ i ngư ờ i nhiề u sứ c khỏ e
CSharpHarwareAdministrator
- 这个程序可以监视当前系统的设备列表，监视那个设备被加载或卸载，并且，还可以启用、禁用系统设备类别中的任何一个设备节点。-Hardware Helper Library for C# How to monitor, enable, and disable hardware devices from C#. There isn t really a lot of background required for you to use the library I ve provided. The hea
JOSEPHhuan
- 演示程序中，人数n应为任意的，首先应输入一个值赋给初始报数上限m，程序应能自动保存出列人的序号和将出列的人所持的密码赋给m，再次作为报数上限，如此循环，直至所有人都出列为止-Demonstration program, the number n should be arbitrary, we must first enter a value assigned to the initial reported that the maximum number of m, the procedure s
CLR_via_CSharp_2E
- 框架设计（第2版）：CLR Via C# 被china-pub会员评为“2007年我最喜爱的十大技术图书”之一 知名技术作家类Jeff Richter 为您提供专业指导，让您迅速掌握CLR和.NET Framework 2.0-The purpose of this book is to explain how to develop applications and reusable classes for the .NET Framework. Specifically, this m
hotelmanager
- 这是一个酒店管理系统。用C#语言编写，很实用，是学习的好列子。-This is a hotel management system. Prepared using C# language, it is practical, is to learn from good examples.
1
- M/M/1排队系统 M/M/1排队系统 M/M/1排队系统 M/M/1排队系统 -M/M/1 queuing system M/M/1 queuing system M/M/1 queuing system M/M/1 queuing system M/M/1 queuing system M/M/1 queuing system M/M/1 queuing system M/M/1 Queuing System
Josephus
- 有N个小孩围 成一圈并依次编号，教师指定从第M个小孩开始报数，报到第S个小孩即令其出列。然后从下一个孩子继续报数，数到第S个小孩又令其出列，如此直到只剩一个小孩。求小孩出列的先后顺序。-There are N child form a circle and followed by number of teachers designated M from the first child to start off, the first S to report that their child out
122
- 世界名画陈列室由m*n个排列成矩形阵列的陈列室组成。为了防止名画被盗，需要在陈列室中设置警卫机器人哨位。每个警卫机器人除了监视它所在的陈列室外，还可以监视与它所在的陈列室相邻的上、下、左、右4个陈列室。试设计一个安排警卫机器人哨位的算法，使得名画陈列馆中每一个陈列室都在警卫机器人的监视下，且所有的警卫机器人数最少。-Gallery by the world famous painting of m* n rectangular array arranged in the composition
zuishaoyingbi
- 设有n种不同面值的硬币，各硬币的面值存于数组T[1:n]中。现要用这些面值的硬币来找钱。可以使用的各种面值的硬币个数存于数组Coins[1:n]中。 对任意钱数0<=m<=20001,设计一个用最少硬币找钱m的方法。 -N has a different face value coins, the face value of the coins stored in the array T [1: n] in. Is to use these coins to find the
ArcEngine
- 公交四大发明不到vnfg。， 分工包括和你f.m,fdsb -gongjiao
strings
- This for C# document. I m try to use it!-This is for C# document. I m try to use it!
BRMUL
- 求m*n阶矩阵A与n*k阶矩阵B的乘积矩阵C=AB-we can get the product matrix C from m*n matrix A and n*k matrix B.
BCMUL
- 求m*n阶复矩阵A与n*k阶复矩阵B的乘积矩阵C=AB。-we can get product matrix C from m*n complex matrix A and n*k complex matrix B.
Josephloopproblem
- 已知n个人（以编号1，2，3...n分别表示）围坐在一张圆桌周围。从编号为k的人开始报数，数到m的那个人出列；他的下一个人又从1开始报数，数到m的那个人又出列；依此规律重复下去，直到圆桌周围的人全部出列。-Known n individuals (with numbers 1,2,3 ... n, respectively) were sitting around a round table around. From the number of k, the number of people