I am unable to pass the test cases without TLE and not able to understand how to use bitmasking here

#1

I am unable to pass the test cases without TLE and not able to understand how to use bitmasking here

#2

Using the inclusion-exclusion principle, calculate the LCM of prime subsets, add or subtract n/LCMn / \text{LCM}n/LCM based on subset size, ensuring efficiency with __gcd for large numbers.

#3

You can refer my code as well

#4

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.