Solution:

Let $t$ be the number of members. A candidate with $n$ votes has percentage $\frac{100n}{t},$ so the condition is $\frac{100n}{t} \le n - 1,$ which rearranges to $n(t - 100) \ge t.$ This forces $t \gt 100$ and $$n \ge \frac{t}{t - 100}.$$

If $t \le 133,$ then $\frac{t}{t - 100} \ge \frac{133}{33} \gt 4,$ so every candidate needs at least $5$ votes, and the total is at least $27 \cdot 5 = 135 \gt t$ — impossible.

For $t = 134,$ each candidate needs $n \ge \frac{134}{34},$ i.e. at least $4$ votes, and this is achievable: let $26$ candidates receive $4$ votes each and one receive $30.$ Indeed $\frac{400}{134} \approx 2.99 \le 3$ and $\frac{3000}{134} \approx 22.4 \le 29.$ So the smallest possible number of members is $134.$