[Mod edit: Please avoid posting codes on the forum.]
This is the solution, but I can’t understand how it works ![]()
If you don’t understand any published solution, please quote the author’s name and the programming language instead of posting a solution when you ask here. Or you may ask your question in the comment area of that solution.
What author ? I found a solution on github. One cannot access solution in codingame unless one has a solution. So only way to get to a solution is to find it one the web ![]()
Oops, I assumed you were asking about a published solution on CodinGame…
Then that’s more reason for you not to post a Github solution here…
I was asking for some council. Cause I am really stuck with this combinatorics thing.
You may send me the link in private message. I’ll try to see if I can understand that solution and maybe explain it to you.
Hi everyone!
I use a recursion on the number of rounds left and the number of points that are needed to get for this puzzle.
I’m quite close to the sol but I still get wrong on test 2, 4, 7, 8 and validators 1, 2, 4.
For the 4 tests I get wrong answer I am really near (avg of 30) but every time at a distance of the sol which is a multiple of 8 and I don’t know why…
It seems that my code fails when there are few special cases (at the opposite of tests 3, 5)
As I don’t manage to figure out from which part of my code it comes, I’m asking here if someone could help me.
Thanks!
There are only 50 possible inputs, so you can test them all offline.
To begin, try checking the cases from 49 down to 41 and verify your results with manual calculations.
Okay, i’ll do it thanks a lot!