Nearest Prime Hackerearth

#1

Question Link:-https://www.hackerearth.com/practice/math/number-theory/basic-number-theory-2/practice-problems/algorithm/nearest-prime-a828361b/

Code link:-https://ide.codingblocks.com/s/383484

Please check! What’s wrong with my approach?

#2

You are not pushing all the primes to the vector
Since outer loop is running for i*i<=n

#3

Now, it’s printing on online ide but when I try to submit on hacker earth it gives “Segmentation Fault”.

#4

Hey @div_yanshu07
Sorry missed ur reply

Use bool arr of size n+1

bool p[N+1];