文件名称:tablemeeting
下载
别用迅雷、360浏览器下载。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
如迅雷强制弹出，可右键点击选“另存为”。
失败请重下，重下不扣分。
介绍说明－－下载内容均来自于网络，请自行研究使用
圆桌问题
假设有来自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.cpp
table.ppt
table.ppt