Tubes 2
Public  11/17/14  24xp  Programming  66.7% 
See p180 from Sinan. Now there are 10 tubes named with A,B,C,D,E,F,G,H,I,J with capacities 14,13,12,12,10,10,7,7,7,7 respectively. The first state is (A to J) 10,9,11,10,9,8,5,5,4,2. The goal state is (A to J) 13,12,11,11,4,6,6,0,6,4. Encode each state as a hex number JIHGFEDCBA, so the starting state is 245589AB9A, the ending state is 460664BBCD.
We need to reach to the goal state with the mimimum number of steps.
Let A be the eventual array of size k with the states (from first to last) in it:
A=[245589AB9A,...,460664BBCD]
where A[i] is the state at the ith phase, i=1,..,k
Let N be the hex number obtained by concatenating the hex digits of the above array:
N=245589AB9A...460664BBCD or
N=A[1]*B^(k1)+A[2]*B^(k2)+...+A[k]*B^0 where B=16^10=2^40
Find the smallest N.
(i.e. Find the lexicographically first, shortest path.)
Answer format: N Mod 1000000007
My timing: 60 sec. [[using less than 1GB of Ram]]
We need to reach to the goal state with the mimimum number of steps.
Let A be the eventual array of size k with the states (from first to last) in it:
A=[245589AB9A,...,460664BBCD]
where A[i] is the state at the ith phase, i=1,..,k
Let N be the hex number obtained by concatenating the hex digits of the above array:
N=245589AB9A...460664BBCD or
N=A[1]*B^(k1)+A[2]*B^(k2)+...+A[k]*B^0 where B=16^10=2^40
Find the smallest N.
(i.e. Find the lexicographically first, shortest path.)
Answer format: N Mod 1000000007
My timing: 60 sec. [[using less than 1GB of Ram]]
New Members
 JMR03 1d:19h
 MrSexysPizza 3d:4h
 N3W70N 3d:7h
 cod3bluezer0 4d:13h
 cduruk 1w:2d
Fresh Problems

Segments 1d:11h
solved by 5 
Plowing the field 3d:9h
solved by 11 
Mertens Equations 1w:3d
solved by 9 
Vampire Numbers 2w:3d
solved by 11 
Convex numbers 2w:6d
solved by 4