.

Yes. (And 10 large random tests.)

Can I have two or more examples of the large random tests ? In Python, I see nothing when I print the input. How many large tests are there ?

Is it possible to solve it using basic gaussian elimination ?

Nice one. Function's name is not snake case, the test framework should be imported explicitly, and the return type could be a fraction. Anyway, I'm going to approve it (and then fork it if needed) in the coming days if no one complains in the meantime.

Let's go to Mars! ^^

I was thinking about a new kata in the series, families on Mars, where each person has 2 fathers and a mother. Calculate the coefficients ... :)

That wasn't present. I added a subsection about the family at the beginning of the rules where I put that information.

Not sure this is in the descripton already in some form, but I would add a note:

• a person can have children with at most 1 spouse

Almost a week, damn! I wonder whether I should have a go at a JS translation. (I also wonder why other solutions remain out on the other kata. I hope it gets approved soon.)

Thanks for beta testing it again! (Almost a week.)

Great kata authoring work once again. I can't imagine the time you must have spent on this kata.

nah, I'm probably using a horrible CA finder algorithm. EDIT: indeed, my algorithm was ***

I don't think so. I usually pass the tests between 4 to 6 seconds. Sometimes, rarely, it takes 8 or 9 seconds. If you think that the tests are too unbalanced, I can shrink some of them.

Ok I pass the kata now, except for a timeout. Are there considerable performance constraints? I mean, is caching required or something?

I was, exactly five seconds ago, going to add a note about that. The direction of a path is not important. The path 1 → 2 → 3 is the same than the path 3 → 2 → 1. That's why I chose to show paths in different directions in the sample tests.