As pointed out in the comments, you don't have $1^0$ but $0^0$ instead, because the last term in the product is $\frac{1}{n}$ and the other terms are less than $1$. So it is an indeterminate form that needes to be worked out wisely. In this case, by taking the $\log$.
But I don't see how to solve this using just elementary single-variable Calculus...
Let us use the weakest form of Stirling's approximation:
$$
\log n!
=
n \log n - n + e_n
,
$$
where
$$
0
\leqslant
e_n
\leqslant
2 + \log n
.
$$
(This form of Stirling's approximation can be proved using elementary Calculus, though.)
So taking $\log$ you get
$$
\log \lim_{n\to\infty} \Big(\frac{n!}{n^n}\Big)^{\frac{1}{n}}
=
\lim_{n\to\infty} \frac{\log n! - n \log n}{n}
=
\lim_{n\to\infty} \frac{-n + e_n}{n}
=
-1 + \lim_{n\to\infty} \frac{e_n}{n}
\overset{H}{=}
-1
,
$$
where in $\overset{H}{=}$ we used both l'Hôpital and Squeeze Theorem.
Finally,
$$
\lim_{n\to\infty} \Big(\frac{n!}{n^n}\Big)^{\frac{1}{n}} = \exp\bigg[ \log \lim_{n\to\infty} \Big(\frac{n!}{n^n}\Big)^{\frac{1}{n}} \bigg] = e^{-1}.
$$
Proof of Stirling's approximation. First write
$$\log n! = \log 1 + \log 2 + \cdots + \log n,$$
which
is bounded from below by
$$
\log n!
\geqslant
\int_0^n \log x \, d x
=
n \log n - n
$$
and from above by
$$
\log n!
\leqslant
\int_1^{n+1} \log x \, dx
=
(n+1) \log (n+1) - n
\leqslant
n \log n - n + \log n + (n+1)\log \frac{n+1}{n}
$$