2489 - Spreading Gossip

[serur]

Only anupam got it working, and no one else...
But is it not just bfs? Dimaeter of a bfs-tree, associated with the first house?
what does this mean:

n 20

may be n <= 20, or some digist are missing?

[mjd]

This is the graph broadcast problem (do a google search), where telephone
calls are made to distributed a message. It is a NP-complete problem
so the restriction for n <= 20 houses means that a backtracking brute-force
algorithm is required.