Notice that all such fractions must be in the form $\frac{\gcd(a,300)=1}{30}, a < 300.$ Since the sum of all numbers less than and relatively prime to a number $n$ is $\frac{n \cdot \phi(n)}{2},$ if $n=300,$ we have:
$$\frac{300 \cdot \phi(300)}{2}= \frac{300 \cdot 80}{2}=12000.$$
Now, we can't forget that we have a denominator of $30$ so we must divide by $30,$ leaving us with $\frac{12000}{30}=400.$ And thus $400$ is our final answer.
Note: $\phi(n)$ is the totient of $n,$ it counts the number of integers less than $n$ that are relatively prime to $n.$
Note: The formula $\frac{n \cdot \phi(n)}{2}$ comes from the fact that for every integer $a$ that is relatively prime to $n,$ $\gcd(a,n)=1,$ and therefore $\gcd(n-a,n)=1$ by the euclidean algorithm. Thus every number relatively prime to $n$ will have a "partner" with which when added to, produces $n.$
Thus we count the number of numbers relatively prime to $n$ and divide it by $2$ to find the number of "partners." Since we know that every pair of "partners" will add up to $n,$ we multiply the expression by $n.$ Hence:
$$\frac{n \cdot \phi(n)}{2}.$$
Hope this helps! (Pls upvote!)