|
|
Nice contest. I think I liked problem D (Dragon Curves) the most, but I also found it quite difficult so it surprised me to see so many people getting it right. Maybe it's the UVA thing sohelH mentioned before.
For problem G, it was a bit unclear whether the graph could have more than one connected component. The "family tree" explanation given in the first paragraph gave me the impression that this couldn't happen, but after reading the input description I wasn't so sure, so I had to handle the case just to be safe. |
