GCD Subsets

CSESAdditional Problems IIOpen on judge ↗

You are given an array of n integers. Your task is to calculate the number of non-empty subsets whose elements' greatest common divisor is equal to k for each k = 1,\dots, n. Input The first line has an integer n: the size of the array. The next line has n integers x_1, x_2,\dots, x_n: the contents of the array. Output Print n integers as specified above modulo 10^9 + 7. Constraints - 1 \le

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI