Hello friends! Hope you all are well...↵
Today I give you a problem of Maths you k Know Mathis are also very important for coding so.↵
↵
↵
The problem is this.↵
↵
↵
" Consider a 4 colored cube of 343 small cubes each of dimension 1 x 1 x 1 havin one particular color. No two consecutive cubes on the outer sides can be of san color.↵
(a) How many at most smaller cubes of each color are possible.↵
(b) At most how many of cubes of different colors would be visible form a single point in space.↵
(c) At most how many cubes of each color in diagonal would be visible from this the time to participate in div.3 and you know its not easy contest well. I want some tips from the heroes of codeforces to increase my rating that is very low. So, give saome pohint.'''↵
↵
↵
Please reply me afters and suggest thme solutionme thing.↵
↵
↵
↵
Thanks,↵
↵
↵
↵
The problem is this.↵
↵
↵
" Consider a 4 colored cube of 343 small cubes each of dimension 1 x 1 x 1 havin one particular color. No two consecutive cubes on the outer sides can be of san color.↵
(a) How many at most smaller cubes of each color are possible.↵
(b) At most how many of cubes of different colors would be visible form a single point in space.↵
(c) At most how many cubes of each color in diagonal would be visible from th
↵
↵
Please reply me after
↵
↵
↵
Thanks,↵
↵
