Network Renovation CSES Problem set

Правка en1, от ksb_451, 2020-09-02 12:56:56 Please give any hints to this problem. I have been stuck for quiet a while.

Syrjälä's network consists of n computers and n−1 connections between them. It is possible to send data between any two computers.

However, if any connection breaks down, it will no longer be possible to send data between some computers. Your task is to add the minimum number of new connections in such a way that you can still send data between any two computers even if any single connection breaks down.


  Rev. Язык Кто Когда Δ Комментарий
en1 Английский ksb_451 2020-09-02 12:56:56 562 Initial revision (published)