> Thank you for your message.
> We greatly appreciate your support.
>
> > The problem description reads:
> >
> > > If there are multiple sightseeing routes of the
> > > minimal length, you can output any one of them.
> >
> > Are you sure you are checking this? Or are you only
> > comparing the output files for exact equality?
>
> It's really our bug, but we are working on it. You should realize that filling the judge with problrms an tests takes a lot of time.
>
> > I'm quite sure my program is correct (i participated
> > in the contest you took the problem from...)
> > but it is rejected with "wrong answer". Could you
> > please verify that you accept ALL correct answers,
> > not only those that are exactly equal to your output
> > files?
>
> We are absolutely sure that your program is correct.
> But we recommend you to resubmit when we fix the problem.
> We will notify fixing on the WebBoard.
>
>
> Good Luck!
>
> <A HREF="mailto://mb.timus.ru"> Marat Bakirov, MCP, Timus Group </A>
>
I've done it!
