文件名称:tablemeeting
-
所属分类：
- 标签属性：
- 上传时间：2012-11-16
-
文件大小：10.65kb
-
已下载：0次
-
提 供 者：
-
相关连接：无下载说明：别用迅雷下载，失败请重下，重下不扣分！
介绍说明－－下载内容来自于网络，使用问题请自行百度
圆桌问题
假设有来自n 个不同单位的代表参加一次国际会议。每个单位的代表数分别为R i ( i =1,2,3...n)。会议餐厅共有m张餐桌，每张餐桌可容纳Ci (i =1,2, 3...m) 个代表就餐。
为了使代表们充分交流，希望从同一个单位来的代表不在同一个餐桌就餐。试设计一个算法，
给出满足要求的代表就餐方案。
-Round-table question assumes different from n units of an international conference attended by representatives. The number of units on behalf of each of R i (i = 1,2,3 ... n). Restaurant meeting a total of m tables, each table can accommodate Ci (i = 1,2, 3 ... m) a representative of dining. In order to make the full exchange of delegates, I hope from the same representative of a unit is not the same dining table. Design a test algorithm to meet the requirements of the program on behalf of dining.
假设有来自n 个不同单位的代表参加一次国际会议。每个单位的代表数分别为R i ( i =1,2,3...n)。会议餐厅共有m张餐桌，每张餐桌可容纳Ci (i =1,2, 3...m) 个代表就餐。
为了使代表们充分交流，希望从同一个单位来的代表不在同一个餐桌就餐。试设计一个算法，
给出满足要求的代表就餐方案。
-Round-table question assumes different from n units of an international conference attended by representatives. The number of units on behalf of each of R i (i = 1,2,3 ... n). Restaurant meeting a total of m tables, each table can accommodate Ci (i = 1,2, 3 ... m) a representative of dining. In order to make the full exchange of delegates, I hope from the same representative of a unit is not the same dining table. Design a test algorithm to meet the requirements of the program on behalf of dining.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
table.ppt
table.cpp
table.cpp
本网站为编程资源及源代码搜集、介绍的搜索网站，版权归原作者所有！ 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.