even subsequences

CodeChefOpen on judge ↗

chef's friend is a chemist. He has n atoms. He tells chef to note down the weight of all n atoms . All the weights are EVEN and DISTINCT. chef has to find the number of all the subsequences of atoms whose sum of weights is completely divisible by two. He also, has to find number of pairs of atoms whose sum of weights is completely divisible by two. NOTE: use (long long int). Def

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