Even after applying sieve
How is this getting TLE?
a) u are building quite large size sieve , sieve upto 10^6 is sufficient
b) dont call sieve again n again this will make ur program super slow, call only once ansd store all prime upto 10^6 in some array and then use that array.
refer this ->
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.