Skip to content

rwest/GossipingDons

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

7 Commits
 
 
 
 

Repository files navigation

Each of n elderly dons knows a piece of gossip not known to any of the
others. They communicate by telephone, and in each call the two dons
concerned reveal to each other all the information they know so far. What is
the smallest number of calls that can be made in such a way that, at the
end, all the dons know all the gossip?

About

Each of n elderly dons knows a piece of gossip not known to any of the others....

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages