can u plz tell y am i getting timelimit in one testcase
ARRAYS:Prime Visits
@ashigupta.gupta570
As the constraints mentioned in the problem are extremely large , you should use an optimised technique to compute primes. Use the Sieve technique which is discussed in detail in the Number Theory section of your course to solve this problem efficiently. The brute force method will not work for such large testcases.
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.