Thank you!
In this forum I knew how solve this task!

We must find lengths of pathes for every element of permutation and count their LCM.

Don't forget about Int64 in Pascal and long long in C++.

Here is my AC solution:

[code deleted]

Edited by author 15.08.2005 07:46

Edited by moderator 04.12.2019 20:48

Edited by author 17.02.2008 09:53

thanks a lot!!  i can't find correct algo till today!!

i think that this code must be deleted

This code give TLE on test 9, how did you have AC?

Ydiota crocodilia pute

You don't need long long or int64.
Also, please delete your code, posting correct solution is against the rules!

Edited by author 28.10.2011 00:27