Whats wrong in my solution

beyond integer range
also prime sieve is wrongly written
like u need to first make the entire prime array as 1 ( assume all are prime)
then update the array acc to if they are prime or not
line 16 needs to be p[j] = 0
refer to this code
but i have used long long so no problem of integer range and we can also set all bits as 0 first and for prime no we change it into 1. Is i am wrong??
