ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1086. Cryptography

WA#2 - Answer
Posted by Deem 7 Oct 2008 17:52
You probably get WA#2 because your "for" goes untill 15001. Like this: for (i = 7; i < 15001; i++). Actually amount of prime numbers when i == 15001 is nearly about 2500. You need to make a counter of prime numbers and generate primes while (count <= 15001). Then your programm will be AC!
Re: WA#2 - Answer
Posted by mhg 30 Jul 2014 14:54
hi,thanx man.