diff --git a/gsd-questions.tex b/gsd-questions.tex
index 5c263d3..fffd060 100755
--- a/gsd-questions.tex
+++ b/gsd-questions.tex
@@ -9,6 +9,7 @@
 \usepackage{colortbl}
 \usepackage{anysize}
 \usepackage{enumerate}
+\usepackage{verbatim}
 
 \usepackage[utf8]{inputenc}
 \usepackage{amssymb}
@@ -50,11 +51,6 @@ $$
   2.82 \\ 5.65 \\ 7.81
 \end{array}\right)
 $$
-\ifdefined\loesung
-\begin{verbatim}
-Musterloesung here
-\end{verbatim}
-\fi
 
 \subsection{Merging and Sorting}
 Let $A$ and $B$ be two arrays of $n$ (unsorted) integer entries each. Write
@@ -69,11 +65,6 @@ $$
 \end{array}
 $$
 
-\ifdefined\loesung
-\begin{verbatim}
-Musterloesung here
-\end{verbatim}
-\fi
 
 \subsection{Recursion}
 
@@ -81,9 +72,8 @@ Consider a herd of cows. Write a \emph{recursive} function to calculate the
 sum of all legs. Use addition only (no multiplication allowed).
 
 \ifdefined\loesung
-\begin{verbatim}
-Musterloesung here
-\end{verbatim}
+\subsection{Loesung}
+\verbatiminput{todten/GSDSolution.java}
 \fi
 
 \section{Algorithms and Data Structures}