Prime visits of pmo

#1


it shows the time limit exceeds

#2

@Learning_bunny hey piyush use prime sieve to solve this problem.

#3

as i understood it, first we form an array of a to b then remove elements which are multiple or square of numbers from 2 to b and count the rest of numbers. if that is it then how can we remove elements in array i mean those elements who are square or multiples of numbers from 2 to a

#4

bhaiya please tell how to do it

#5

@Learning_bunny see this