here is the code >>>https://ide.codingblocks.com/s/481245
sir, this code same as video but still showing segmentation fault. please mark what is mistake in the code?
also sir, tells the significant of this code >>>
const long long int n= 10000000;
bitset<10000005>b;
vectorprimes;
<<<
and what is bitset ?
hello @r_kumar_17
check now
a bit set is like array of bool , but instead of storing bool in array we use bits to save the space.
defining a constant till which we want to store prime
defining a bitset of mentioned size so that we can use it as array
a vector to store all the prime numbers
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.