Please help me with the code

#1

https://ide.codingblocks.com/s/270200. What are the corner cases that I’m not considering. I think the range that I’m taking is the problem.Please help

#2

since the constraints are large
do not make a prime sieve because we do not no till where we need to make the sieve

for(int i=2;i*i<=N;i++)
    if(N%i==0)
    { logic }

use the conventional logic of findinf if the no is prime

u can refer to the method from here

#3

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.