- #1
mostaphaamini
- 4
- 0
Hi all,
I have a question and hope to solve.
problem terms :
1- there are K holes.
2- there are N group of Pigeon.
3- there are M Pigeon in any Pigeon group.
4- each group of Pigeon can chose Z hole so that K >= Z >= M.
5- we don`t know which hole selected by a Pigeon only we know M Pigeon in group select Z hole.
6- the capacity of each hole is exact one Pigeon.
How we can determine last Pigeon group can not enter to the selected holes (because the selected hole are full)?
I have a question and hope to solve.
problem terms :
1- there are K holes.
2- there are N group of Pigeon.
3- there are M Pigeon in any Pigeon group.
4- each group of Pigeon can chose Z hole so that K >= Z >= M.
5- we don`t know which hole selected by a Pigeon only we know M Pigeon in group select Z hole.
6- the capacity of each hole is exact one Pigeon.
How we can determine last Pigeon group can not enter to the selected holes (because the selected hole are full)?