What do we have to do in this question apart from making a prime sieve??
Deepak and Primes
In this question, you just have to make sieve and after that you have to print how many prime numbers are there from range of 2 to n.
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.