Almost Prime(Codeforce)

#1

i not understand what is the approach sir used in this question and i also not understand what is happening in main function

#2

hey @sahudilip138

i c that prateek bhaiya hasnt revealed whats in the main function

so basically u will check if the primes[n] will have count= 2 or not
if yes print yes
else no

#3

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.