# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
947545 | Muaath_5 | Dreaming (IOI13_dreaming) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/*
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
*/