Algorithm

There's a n-element array of integers- 1 or 2.
We have to find subsequence which sum equals x.
How to do that ? I have no fucking idea.
Inb4 bruteforce

>>28
OP, if you really did mean to say "subsequence," then 18 is your answer.  If you meant to say "subset," then it's actually slightly easier...  but the solution to that problem is not posted here.