THIS CODE WORKSSS.. EASYYY PEASYYY

def primeCount(n):
    if n < 2:
        return 0
    primes = []
    candidate = 2
    product = 1
    count = 0
    # We need to find the product of consecutive primes <=n
    while True:
        # Check if candidate is prime
        is_prime = True
        for p in primes:
            if p * p > candidate:
                break
            if candidate % p == 0:
                is_prime = False
                break
        if is_prime:
            if product * candidate > n:
                break
            product *= candidate
            count += 1
            primes.append(candidate)
        candidate += 1
    return count

# Read input and process queries
if __name__ == "__main__":
    q = int(sys.stdin.readline())
    for _ in range(q):
        n = int(sys.stdin.readline())
        print(primeCount(n))

The most beautiful implementation

if(n<2){ return 0; } else if(n<6){ return 1; } else if(n<30){ return 2; } else if(n<210){ return 3; } else if(n<2310){ return 4; } else if(n<30030){ return 5; } else if(n<510510){ return 6; } else if(n<9699690){ return 7; } else if(n<223092870){ return 8; } else if(n<6469693230){ return 9; } else if(n<200560490130){ return 10; } else if(n<7420738134810){ return 11; } else if(n<304250263527210){ return 12; } else if(n<13082761331670030){ return 13; } else if(n<614889782588491410){ return 14; } return 15;

I am trying to use sympy.primerange to get alist of prime numbers, but the output fails with message "no module sympy found"

How can we solve this issue. to access sympy I used import sympy

this is my code

define ll unsigned long long int

include

using namespace std; ll solve (ll n){ ll cnt=0,s=1; vector check {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293}; for(ll i=0;i

    if(s<=n){
        s*=check[i];
        cnt++;
    }
}
return cnt -1;

} int main(){ ios_base::sync_with_stdio(0); cin.tie(0);cout.tie(0); ll q; cin>>q; for(ll j=0;j>n; cout<

}

return 0;

}

Here my code

class Result {
    public static boolean isPrime(int p){
        for(int i = 2 ; i<=p/i ; i++){
            if(p%i==0)
                return false;
        }
        return true;
    }
    public static int primeCount(long n) {
        long acum = 1;
        int count = 0;
        for(int i = 2 ; acum<=n/i ; i++){
            if(isPrime(i)){
                acum*=i;
                count++;
            }
        }
        return count;
    }
}