![Kitchen(); Task N32. - 1]()
Rules [One-dimensional arrays] 32. A secret lock for a safe consists of 10 cells arranged in a row into which dice must be inserted. But the door opens only if in any three adjacent cells the sum of the dots on the front faces of the cubes is equal to 10. (A dice has from 1 to 6 dots on each side.) Write a program that solves the lock code, provided that two dice already inserted into the cells. --- --- --- --- --- --- ---
What weapons could different programming languages be --- --- --- --- --- --- ---
Rules [One-dimensional arrays] 32. A secret lock for a safe consists of 10 cells arranged in a row into which dice must be inserted. But the door opens only if in any three adjacent cells the sum of the dots on the front faces of the cubes is equal to 10. (A dice has from 1 to 6 dots on each side.) Write a program that solves the lock code, provided that two dice already inserted into the cells. --- --- --- --- --- --- --- What weapons could different programming languages be --- --- --- --- --- --- ---
GO TO FULL VERSION