# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947545 | 2024-03-16T11:27:48 Z | Muaath_5 | Dreaming (IOI13_dreaming) | C++17 | 0 ms | 0 KB |
/* Problem: IOI13_dreaming Statement: Given a forest (m < n-1), connect n-m-1 edges to make it a tree. What is the minimal diameter */