Prime Visits problem

#1


I am not understanding where should count be initialized so as to give the correct answer.Please help.

#2

@srshubhi398

make the prime sieve once and then
simple iterate over the range [a,b] and count no of nmbers which are prime

1 Like
#3

thamkyou ,I understood that I needed to use prime sieve but was my logic incorrect or was there any other error in my code?

#4

it was a brute approach and given the constraints it will give tle
u can utilise the knowledge of sieve of eratosthenes in this question

1 Like
#5

Thanks a lot for the suggestion.

1 Like
#6

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.