| Title |
User |
Message |
Date Posted |
| Re: hahaha |
Alex |
wtf... Daniel got to solve his own problem? |
May 20, 2013 - 11:13:31 pm UTC |
| Re: hahaha |
SourSpinach |
Yup... unfortunately, we completely forgot this question existed when designing the Stage 2 problem set. |
May 20, 2013 - 2:42:15 pm UTC |
| hahaha |
ImbaCalvin |
This question is identical to http://wcipeg.com/problem/ccc13s2p3 |
May 19, 2013 - 11:35:16 pm UTC |
| Re: Re: Data Errors |
bbi5291 |
To generate a random tree, use a randomly generated Pruefer sequence. |
Aug 14, 2012 - 1:40:56 am UTC |
| Re: Data Errors |
Daniel |
Fixed. |
Aug 13, 2012 - 9:31:07 pm UTC |
| Data Errors |
SourSpinach |
It looks like case 5 contains at least the following cycle: 259 - 829 - 79 - 24 - 885 - 220 - 753 - 942 - 482 - 952 - 492 - 741 - 259 Other cases may also contain cycles, but I didn't check. Updated... |
Aug 13, 2012 - 4:25:49 am UTC |
| Haha |
SourSpinach |
The limit on the answer is (N-1)*(N-2), which means that it could just barely overflow an int. Looks like this isn't used in the test data, but that would've been mean =P |
Aug 13, 2012 - 3:29:14 am UTC |
