Im not asking for a code, but just the idea behind the solution about it. I solved the example, but with high prime numbers obvs not.
Im pretty sure u dont have to mind at all the N prime numbers, and just find out the prime numbers without computing all the prime numbers required. but still my ideas can be not the right answer. For who has already solved it, what is the idea, solution to solve this challenge? thx a lot. -- You received this message because you are subscribed to the Google Groups "Google Code Jam" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/6ca6562d-6570-4b12-849d-feee73a91a5f%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
