After 32 meetings of green and blue chameleons, numbers will be [98, 0, 3] (chameleons don't disappear, so the sum must remain the same). After that, meeting red+blue gives [97,2,2] and then you need TWO more meetings of green+blue to get [101, 0, 0]. 32+1+2 = 35.
Can you please helt me to undaetnad the problem, 34, 32, 35 -> 35 -32 = 3, so will be come 50, 0, 3 and 49, 2, 2 and 51, 0, 0 so counting this will become 34 not 35, please help me to undertand the task is not very clear, Thank you!
Outch.
Test added and description updated.
The new test case killed one third of solutions.
Python version updated:
[0,1,6], 1(thanks to lechevalier)The kata needs random tests.
I have to say that Pete writes pretty shitty code :D
Nice kata nevertheless.
I honestly love how this balances clear readability and effective run time but in a bastardized way hahaha.
A little too much hardcoding for my taste.
Seems ok indeed. Maybe I did something wrong. Thanks for answering!
Have you tried since? I haven't noticed any issue.
Maybe you should try to press the Reset button?
Unless I do miss something there's a problem with tests since initial code times out.
It was difficult to understand the task just by looking at the text, but happy could solve it finally.
Thanks, now its clear!
After 32 meetings of green and blue chameleons, numbers will be [98, 0, 3] (chameleons don't disappear, so the sum must remain the same). After that, meeting red+blue gives [97,2,2] and then you need TWO more meetings of green+blue to get [101, 0, 0]. 32+1+2 = 35.
Can you please helt me to undaetnad the problem, 34, 32, 35 -> 35 -32 = 3, so will be come 50, 0, 3 and 49, 2, 2 and 51, 0, 0 so counting this will become 34 not 35, please help me to undertand the task is not very clear, Thank you!
This comment is hidden because it contains spoiler information about the solution
Loading more items...