I like Cameron Buie's answer, but let's generalize!
How many integers between $a$ and $b$ are divisible by $d$?
Let $\#S$ be the size of a set $S$, and let's only consider integer-type variables, then we want
$
\;\;\;\;\;\#\{n : n \in a .. b \text{ and $d$ divides } n \ \}
\\
= \#\{n : a \leq n \leq b \text{ and $n$ multiple-of } d \ \}
\;\;\;\; \text{, rewrite condition}
\\
= \#\{d \times n : a \leq d \times n \leq b \text{ and $d \times n$ multiple-of } d \ \}
\;\;\;\; \text{, dummy rename}
\\
= \#\{d \times n : \frac{a}{d} \leq n \leq \frac{b}{d} \}
\;\;\;\; \text{, arithmetic and second condition is true}
\\
= \#\{d \times n : \lceil\frac{a}{d}\rceil \leq n \leq \lfloor\frac{b}{d}\rfloor \}
\;\;\;\; \text{, inequalities ---see below$(\star)$}
\\
= \lfloor\frac{b}{d}\rfloor - \lceil\frac{a}{d}\rceil - 1
\;\;\;\; \text{, integer intervals $p..q$ have $q-p+1$ elements}
$
Neato! Now for your case $a,b,d := 100,999,3$ and so we have $\lfloor\frac{999}{3}\rfloor - \lceil\frac{100}{3}\rceil - 1 = 333-34+1=300$ numbers between 100 and 99 that are divisible by 3.
With a bit more effort we have a more general result :)
$(\star)$ If $n$ is an integer less than a real $x$ then it's also less than the floor of $x$; eg $n \leq 3.14$ iff $n \leq 3$ since $n$ is an integer. In-general,
$$
\;\; \forall n \in \mathbb{Z},x \in \mathbb{R} :: n \leq \lfloor x \rfloor \equiv n \leq x \;\;
$$
is the characterization of the floor function; similarly for the ceiling function. Enjoy!
The fact that $\#(p .. q) = q - p + 1$ can be proven by induction; where for integers $p,q$ we define $p .. q := \{ n \in \mathbb{Z} : p \leq n \leq q \}$, which I call ``$p$ upto $q$''.