I can’t make a program that doesn’t run out of time or memory for finding prime numbers in interval. I used segmented sieve, got 2gb of memory usage. Checking prime from 1 to sqrt(n) still prints TLE. I really dont know what to do…
created
last reply
- 1
reply
- 334
views
- 2
users