Not so easy math challenge

#1

Inclusion Exclusion concept from bitmasking

whats the error in this code?

#include
using namespace std;
#define ll long long
int main() {
ll t;
cin>>t;
ll primes[] = {2,3,5,7,11,13,17,19};

while(t--){
	ll n;
	cin>>n;

	ll subsets = (1<<8) - 1;
	ll ans = 0;

	for(ll i = 0; i<=subsets; i++){
		ll denom = 1ll;
		ll setBits = __builtin_popcount(i);

		for(ll j= 0; j<=7; j++){
			if(i & (1<<j)){
				denom = denom * primes[j];
			}
		}
		if(setBits&1){
			ans += n/denom ;

		}else{
			ans -= n/denom;
		}

	}
	cout<<ans<<endl;
}
return 0;

}

#2

Start the outer for loop from 1

#3

Done, It worked well.