once you return to it you know that's where loops starts :)

I have a question its different with this kata but does anybody know how to find the position where it starts connecting?
When I was working on this kata this question pop in my head.

can I just post a function here with a spoiler mark, is it fair?

This is a test case exactly as described in the description. Why can't you just read examples?

1 vs 1 0
4 vs 3 +1
1 vs 5 -1

So it should be a draw. (you get to pick who fights who)

{1, 4, 1} vs {1, 5, 3}
Shouldn't it be defeat since 0 vs 2, why it says recieved should be stalemate. C

I know this may look bad, and I understand.
At first i was just going to loop till the the part of a, then I though to myself. If I did that how long will this program run.
I was though speed is everything since in my univ they put a timer in the program on how long it can run, but they don't really mind how big the data usage is.

Post your code using markdown formatting and marking your post as having spoiler content. I can't reproduce what you say you see.

Here is print: numbers [355], attempts 1.
Error:
[355] should equal [0, 355]

fixed

There's wrong in the coding for c, tester is invalid for C99