BALTIC-WAY 2016 Problem 14
A cube consists of unit cubes each containing an integer. At each move, you choose a unit cube and increase by 1 all the integers in the neighbouring cubes having a face in common with the chosen cube. Is it possible to reach a position where all the integers are divisible by 3 , no matter what the starting position is?
Dataset text NuminaMath olympiads. Quoted with source.
Solutions
No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.