Sort 9 Discussions, By:
Please Login in order to post a comment
any hints on how to pass 2nd and 3rd testcases? n >= 100000
hi how to provide input to this solution
I can't manage to get it to run in time :C
So far I found the general and I'm just passing it layer, height, depth and width and add one to the amount of cubs found with the result's cubes.
I did a very, very optimized version of that, but it doesn't run on time so I guess there is something I'm not catching.
can someone explain how c(154)=10
There isn't any timelimit correct? I have nested loop with large values....