Question
Given an integer n and a list of distinct primes, count how many integers in [1, n] are divisible by at least one of the given primes. Summing floor(n/p) over-counts numbers divisible by several primes, so apply the inclusion-exclusion principle over all non-empty subsets of the primes: add floor(n / product) for odd-sized subsets and subtract for even-sized ones. The list is small enough to enumerate subsets.
count_divisible_by_any(n: int, primes: list[int]) → int[10,[2,3]]out7State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
Vibe coding: describe the solution in plain language (or narrate it) and the coach grades your approach. Generating runnable code from your description is coming next.