Solved by 150 users: ...
UserDateAttemptTimeCMSC
marian`26 oct 2004`C++100.02445
old1`17 apr 2006`C++300.03497
RAVEman`05 jan 2009`C++1100.02505
tomek`19 feb 2006`C++400.70511
RAVEman`05 jan 2009`C++800.02512
RAVEman`05 jan 2009`C++900.02512
RAVEman`05 jan 2009`C++700.02513
Awk`30 oct 2006`C++500.19514
RAVEman`05 jan 2009`C++600.02519
old1`17 apr 2006`C++100.03533
tomek`19 feb 2006`C++500.03545
bloodmage`05 apr 2006`C++100.02589
Madiyar_Tktl`19 jan 2014`C++300.03613
tourist`05 nov 2007`Kylix100.01621
ethanhunt`14 aug 2007`C++500.03621
ethanhunt`14 aug 2007`C++300.03624
ethanhunt`14 aug 2007`C400.03624
ethanhunt`14 aug 2007`C100.03627
Madiyar_Tktl`19 jan 2014`C++200.02629
Abzal_ktl`27 dec 2007`Kylix100.02630
 C++ 86 FPC 44 Kylix 14 Java 6 C 4
` >  >  >  >  >  >  >  >  >  > `

## Chess Cube

Time limit = 5 second(s)

Cube is on one of square of chessboard. There are positive integers on cube sides. You should roll the cube to the desination square and get minimal penalty. Each move penalty is increased be the number that is on the down-side of the cube.

Input The initial and the destination square of the cube. Then six numbers follow: numbers on the south, north, up, right, down and left sides.

Output Your program should output minimal penalty.

 Input#1```a1 b2 1 1 1 1 1 1 ``` Output#1```3 ```
 Input#2```e2 e3 0 8 1 2 1 1 ``` Output#2```5 ```

Author:
III St-Peterburg school team contest, 9 December 1995. Played at MIPT contest 3 October 2004.

<PREV | Problem set | Search related messages | NEXT>

 © acm.mipt DevGroupThe page was generated in 200ms