a**e
发帖数: 25 | 1 a dinner party group containing n people. These people sit at tables that
hold k people (k <= n). The goal is to create an algorithm that creates a
seating chart for each of d dinner party events according to the following
constraints:
1. d is minimized. These people get tired of each other eventually, and
the food gets expensive, so we want to hold the minimum number of dinner
parties possible.
2. After d events, each person should have met (sat at the same table
with) everyone else.
Consider 2 |
|
