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…
Check primes in the interval only. Use something like miller-rabin, or trial division perhaps. I’ve tried these, and still haven’t got AC though.
