I dont know how to bitmask since i have never done it

#1

https://hack.codingblocks.com/contests/c/512/136

please provide me with a suitable example and then logic about how to proceed with this question

#2

This question can be done by brute force also

#3

As the constraints given in the question are smal
n<=4 only

#4

So for this question you can even check all possible pairs and see if any subset sum is 0.

#5

You can learn bitmasking from videos of Prateek bhaiya.