Hi, I need help with this problem
http://uva.onlinejudge.org/index.php?option=com_onlinejudgeItemid=8page=show_problemproblem=38
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algogeeks@googlegroups.com.
as there are only 6 possibilities, i think this will do
BCG
BGC
GCB
GBC
CBG
CGB
for each find no of moves, and print min
On Tue, Feb 22, 2011 at 2:51 AM, rgap rgap...@gmail.com wrote:
Hi, I need help with this problem
