On a blackboard, there are $11$ positive integers. Show that one can choose some (maybe all) of these numbers and place "$+$" and "$-$" in between such that the result is divisible by $2011$.
Problem
Source:
Tags: pigeonhole principle, modular arithmetic, combinatorics proposed, combinatorics