Hello,

I have tried to solve the problem in all the ways but got wa in 0:004s.

What may be the problem??

My method is first to choose the bound (lower and upper) of n1, where n1 is the disks taken from n disks to intermidiate pegs. and then solve the problem by D and C method(Divide and Con.).

Please discuss abt the common errors for this prticular problem. I used POS system.(Optimal and Greedy).

My question is:

When I got the inequility, what should i do??

I have taken the least value of n1 from the inequility.

Should I choose the mean value of the ineuility or should i choose the upper bound??

I saw it has no special judge problem.

So what abt the cases when I have several n1 to choose, can it give different value for each n1??

Thabk for help.

If you can't understand, I will put my src here..

Hello,

I have tried to solve the problem in all the ways but got wa in 0:004s.

What may be the problem??

My method is first to choose the bound (lower and upper) of n1, where n1 is the disks taken from n disks to intermidiate pegs. and then solve the problem by D and C method(Divide and Con.).

Please discuss abt the common errors for this prticular problem. I used POS system.(Optimal and Greedy).

My question is:

When I got the inequility, what should i do??

I have taken the least value of n1 from the inequility.

Should I choose the mean value of the ineuility or should i choose the upper bound??

I saw it has no special judge problem.

So what abt the cases when I have several n1 to choose, can it give different value for each n1??

Thabk for help.

If you can't understand, I will put my src here..