what is maximun value of prime number we can find with seive of eratosthenes without having error My bruteforce code
int a[n+1] ={0}; for(int i=2;i<=n;i++)
