diff options
Diffstat (limited to 'Practical2/report/report.tex')
-rw-r--r-- | Practical2/report/report.tex | 8 |
1 files changed, 5 insertions, 3 deletions
diff --git a/Practical2/report/report.tex b/Practical2/report/report.tex index 4c71eee..2aeb621 100644 --- a/Practical2/report/report.tex +++ b/Practical2/report/report.tex @@ -63,7 +63,9 @@ \thispagestyle{fancy} \begin{abstract} - %todo + Given a list of $n$ numbers $a_0, a_1, \dots, a_{n-1}$, we consider one of its partitions in $k$ (possibly empty) pairwise disjoint substrings such that the sum of the sums of the substrings, rounded to multiples of $5$, is minimal. + + This paper describes an algorithm to find the minimal sum for such a partition. It can easily be extended to find such a partition as well. \end{abstract} \section{Report organisation} @@ -73,8 +75,8 @@ When we have seen the algorithm, \autoref{sec:implementation} will go into detai \input{notation} \input{algorithm} -%\input{implementation} -%\input{analysis} +\input{implementation} +\input{analysis} %\input{discussion} \end{document} |