this should return an error if n = 2 or n = 1

Finally I found a solution for this. I thought backtracking wont work at all but after finding some cases to rule out some trie way ealier it worked. My code needed 8 seconds solve all of the random and basic tests which is not fast at all but at least its working :D

this was way simpler than I thought.

In c you swaped expect and actual. If you turn in a wrong soltuion it will tell that yours is the expected one.

it doesnt make a difference in this case because sizeof(*ret) euqals 1.

I dont get why this works

I am not even sure my solution is correct because theres only one test which is false because of an box mistake.

check some testcases. For me the one with 7919 was my problem but was an easy fix :)

I had the same problem. My loop got stuck when the input already was a prime number.

this was a really challenging one. Mostly because of the output. My code is completely unreadable but its working :)

no norminette errors :D

did anyone else got confused becaus you coudnt loop threw the source? it wasnt null-terminated ...

probably no input at all

when I tried: while (i < n) it timed out...