Poor description IMO
This comment is hidden because it contains spoiler information about the solution
That's the number of pieces of an n+1 by n+1 by n+1 Rubik's Cube!
(and yes, this isn't an 8 kyu kata at all)
Thank you for this. I looked at the disourse section because I couldn't make sense of the task. I even tried to research the painted cube problem to no avail :D
I understand that we are counting the resulting cubes with at least 1 blue face not one red face. BTW side is not a property of a solid. Please make correction and use vertex, edge and face instead
Ok ! I got it ! For the future lost guys after me :
You cut only once ! I thought it was 1 cut, then 1 cut, then 1 cut... In fact, you have the same big cube, and the cut results in many small cubes, in only one operation ; if cuts=1, then you cut in the middle of the cube, in three directions. If cuts=4, then it's like you cut it 12 times (4*3) at the same time.
Good luck ! :)
I read it several times, and I still don't understand...
Don't get the examples either... :D
I just translated this in Java if somone could approve it. Thanks
Just starting codewars, this has been the most challening to me, had to draw several cubes, cut them in the dimmensions and counting to establish a pattern, finally passed the tests