Problem

Source:

Tags: floor function, inequalities, algorithm, combinatorics unsolved, combinatorics



Let $n_1,n_2, \cdots, n_{26}$ be pairwise distinct positive integers satisfying (1) for each $n_i$, its digits belong to the set $\{1,2\}$; (2) for each $i,j$, $n_i$ can't be obtained from $n_j$ by adding some digits on the right. Find the smallest possible value of $\sum_{i=1}^{26} S(n_i)$, where $S(m)$ denotes the sum of all digits of a positive integer $m$.