Problem

Source: Problem 1

Tags: ceiling function, modular arithmetic, combinatorics proposed, combinatorics



1. Around a circumference are written $2012$ number, each of with is equal to $1$ or $-1$. If there are not $10$ consecutive numbers that sum $0$, find all possible values of the sum of the $2012$ numbers.