Project translated automatically. Log in or register, to view the original You need to code the simple algorithm described here-http://know.sernam.ru/book_graph.php?id=64 The task is to find and remove all the stumbling trees of the specified graffiti. graph in the form of n m x1 y1 w1 x2 y2 w2 ... n-col-in heights, m-col-in rever x1-first height of the rever y1-second height of the rever w-weight rever

Proposals 1

V'yacheslav Voitsikhovsky

Winning proposal

19 0

Projects 16
Rating -
Rating 138

Budget: 200 UAH Deadline: 1 day

Ready to perform

Sergey Vladimirovich
Kyiv, Ukraine

Projects 1
Rating -
Rating 30