← All problemsSign in

Subsets with Fixed Average

CSESAdditional Problems IOpen on judge ↗

You are given an array of n integers. Your task is to count the number of non-empty subsets of the given array with average equal to a. Input The first line has two integers n and a: the size of the array and the target average. The next line has n integers x_1, x_2,\dots, x_n: the contents of the array. Output Print one integer: the number of non-empty subsets with average equal to a, modulo

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

Sign in to chat with the tutor and save your progress.

Sign in to start