T primes problem

#1

Getting segmentation fault :-

#2

@aiman.mumtaz you can make an array of size atmost 10^8, greater than this will give you run error and here you are making array of size 10^11.

#4

@aiman.mumtaz if still you are facing any problem let me know,else mark this doubt as resolved

#5

I used bitset to overcome the space issue but I’m getting this error https://ide.codingblocks.com/s/220562

#6

Hey @aiman.mumtaz
You only need to find prime numbers upto 10^6
T primes are squares of these primes
So use sieve upto 10^6
Then for each element in array calculate square root
If root is integer check if it is prime
If yes print “Yes”

#7

Okay Got it. Btw saw your Real Life Proojects video. Great Going!!

#8

Thanks @aiman.mumtaz :smiley:
Appreciate the feedback