Подтверждаю, у меня такая же проблема!!!

assertEquals uses BigDecimal.equals, which requires the precision to the same too, which can be problematic.

But even then, a custom message should be provided instead of this.

Please try to use the common sense a grade schooler would use to evaluate this question.

I believe a grade schooler will instead yell at the teacher "what the fuck are you doing" if the teacher decides to do this.

This is an insult to what a teacher and student is. Teacher is supposed to do their job explaining things in a way that students can actually understand. Please don't abuse your students and claim you have the authority to do so.

This is not an acceptable answer, so re-raising the issue.

In order for p9F2q to be taken into consideration P9 should be called toplevel, which is not the case. See your own specification "Consider only patterns that are to be executed"

Should be fixed now

Hahahahaha(
You my friend now)

I agree with myjinxin. This should've been 6 Kyu.

You can process all 12,000 in under a second. So the test cases should simply be a lookup rather than generating the solution for each random test. This would let you increase the random tests to say 500 or so.

I thought this is very nice solution but times out. I can only think of finding a way to speed up the search for prime numbers

I've added an error message for this test, but the random tests will probably have to log X should equal Y because printing hundreds-of-elements-long arrays would not be useful, and idk if there's any other meaningful information that could be provided instead.