OJ Board

Hi!!
I've read in previous posts that this problem is about dynamic pogramming, LIS. But I can't see how i can apply LIS to this problem. And why do you sort by strength then by weight? I think we have to take into account the residual strength.

Please give me some hint to get to the solution.

Hi:
I can find the direct cycles as well as you but i',m getting mad about creating the final cycle. Please, give me any hint.
Thnx

ok tnx very much

Hi:
I am trying to solve this problem by exhaustive search. To do it, i try to prune some states. I mean: I generate sequences like (for 4 cells):
0000
0001
0010
0011
0100
.....

while i am generating next state for every cell, if i find some state which doesn't match i don't follow generating and ...

OK
but if you get an "acecpted" please post me a message here or mail to franpas@eudoramail.com

Hi!
I use this formula to create the sequence:
a(1) = 1
a(n) = 1 + a(n - a(a(n-1)))

In other posts i've read sth i don't understand. How do you know a(2