diff --git a/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.pdf b/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.pdf
index e0ad920..897d04d 100644
Binary files a/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.pdf and b/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.pdf differ
diff --git a/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.tex b/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.tex
index a443bff..e385087 100644
--- a/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.tex
+++ b/analise-de-dados/arthur-dolival-analise-de-dados-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Análise de Dados}
-\author{Leetcode 1223}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/analise-de-dados/arthur-dolival-analise-de-dados.pdf b/analise-de-dados/arthur-dolival-analise-de-dados.pdf
index 04071cf..0dc627b 100644
Binary files a/analise-de-dados/arthur-dolival-analise-de-dados.pdf and b/analise-de-dados/arthur-dolival-analise-de-dados.pdf differ
diff --git a/analise-de-dados/arthur-dolival-analise-de-dados.tex b/analise-de-dados/arthur-dolival-analise-de-dados.tex
index a0c950a..5217fc0 100644
--- a/analise-de-dados/arthur-dolival-analise-de-dados.tex
+++ b/analise-de-dados/arthur-dolival-analise-de-dados.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Análise de Dados}{1}{256}{Leetcode 1223}
+\begin{ProblemaAutor}{}{Análise de Dados}{1}{256}{Arthur Andrade D'Olival}
 
 É o seu primeiro dia no \textbf{Departamento de Controle de Qualidade}.
 
@@ -33,6 +33,10 @@ Em seguida, são dados seis inteiros \(d_1, d_2, d_3, d_4, d_5, d_6\), cada um r
 
 A saída consiste em um único inteiro representando o número total de sequências válidas de lançamentos, considerando o resultado módulo \(10^9 + 7\).
 
+\section*{Observações}
+
+Problema adaptado de \href{https://leetcode.com/problems/dice-roll-simulation/}{Leetcode 1223}.
+
 \ExemploEntrada
 
 \begin{Exemplo}
diff --git a/caching-offline/arthur-dolival-caching-offline-tutorial.pdf b/caching-offline/arthur-dolival-caching-offline-tutorial.pdf
index 9ceb50b..41279d0 100644
Binary files a/caching-offline/arthur-dolival-caching-offline-tutorial.pdf and b/caching-offline/arthur-dolival-caching-offline-tutorial.pdf differ
diff --git a/caching-offline/arthur-dolival-caching-offline-tutorial.tex b/caching-offline/arthur-dolival-caching-offline-tutorial.tex
index 6847f3a..114f85f 100644
--- a/caching-offline/arthur-dolival-caching-offline-tutorial.tex
+++ b/caching-offline/arthur-dolival-caching-offline-tutorial.tex
@@ -7,7 +7,6 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Caching Offline}
 \author{}
 \date{}
diff --git a/caching-offline/arthur-dolival-caching-offline.pdf b/caching-offline/arthur-dolival-caching-offline.pdf
index f80b1b3..71550d7 100644
Binary files a/caching-offline/arthur-dolival-caching-offline.pdf and b/caching-offline/arthur-dolival-caching-offline.pdf differ
diff --git a/decode-ways/arthur-dolival-decode-ways-tutorial.pdf b/decode-ways/arthur-dolival-decode-ways-tutorial.pdf
index 4027e79..ca8de49 100644
Binary files a/decode-ways/arthur-dolival-decode-ways-tutorial.pdf and b/decode-ways/arthur-dolival-decode-ways-tutorial.pdf differ
diff --git a/decode-ways/arthur-dolival-decode-ways-tutorial.tex b/decode-ways/arthur-dolival-decode-ways-tutorial.tex
index 725828f..03ed334 100644
--- a/decode-ways/arthur-dolival-decode-ways-tutorial.tex
+++ b/decode-ways/arthur-dolival-decode-ways-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Decodificando Mensagens}
-\author{Leetcode 91}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/decode-ways/arthur-dolival-decode-ways.pdf b/decode-ways/arthur-dolival-decode-ways.pdf
index 3a5c077..d5ebb99 100644
Binary files a/decode-ways/arthur-dolival-decode-ways.pdf and b/decode-ways/arthur-dolival-decode-ways.pdf differ
diff --git a/decode-ways/arthur-dolival-decode-ways.tex b/decode-ways/arthur-dolival-decode-ways.tex
index 63a0fb1..6218548 100644
--- a/decode-ways/arthur-dolival-decode-ways.tex
+++ b/decode-ways/arthur-dolival-decode-ways.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Decodificando Mensagens}{1}{256}{Leetcode 91}
+\begin{ProblemaAutor}{}{Decodificando Mensagens}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em determinar o número de maneiras possíveis de decodificar uma sequência numérica, onde cada número ou par de números representa uma letra do alfabeto latino. 
 A correspondência segue a regra \( 1 \rightarrow A, 2 \rightarrow B, \ldots, 26 \rightarrow Z \). 
@@ -18,6 +18,8 @@ A segunda linha contém uma sequência de digitos de \( s \) de comprimento \( n
 
 A saída deve conter um único inteiro, representando o número total de maneiras possíveis de decodificar a sequência numérica \( s \) de acordo com o mapeamento \( 1 \rightarrow A, 2 \rightarrow B, \ldots, 26 \rightarrow Z \).
 
+Como este número pode ser extremamente grande, sua resposta deve ser calculada e impressa \textbf{módulo \(10^9 + 7\)}.
+
 \ExemploEntrada
 
 \begin{Exemplo}
@@ -35,5 +37,9 @@ A saída deve conter um único inteiro, representando o número total de maneira
 
 Para a sequência \( s = "12" \), existem duas decodificações possíveis: "AB" (1, 2) e "L" (12). 
 Para a sequência \( s = "226" \), há três decodificações possíveis: "BZ" (2, 26), "VF" (22, 6) e "BBF" (2, 2, 6). 
-Para a sequência \( s = "06" \), não há nenhuma forma válida de decodificação.\end{ProblemaAutor}
+Para a sequência \( s = "06" \), não há nenhuma forma válida de decodificação.
+
+\section*{Observações}
+
+Problema adaptado de \href{https://leetcode.com/problems/decode-ways/}{Leetcode 91}.\end{ProblemaAutor}
 \end{document}
diff --git a/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.pdf b/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.pdf
index be8fc33..6318545 100644
Binary files a/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.pdf and b/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.pdf differ
diff --git a/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.tex b/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.tex
index a7b6187..cb79282 100644
--- a/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.tex
+++ b/delete-and-earn/arthur-dolival-delete-and-earn-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Deletar e Ganhar}
-\author{Leetcode 740}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/delete-and-earn/arthur-dolival-delete-and-earn.pdf b/delete-and-earn/arthur-dolival-delete-and-earn.pdf
index 59d5ed8..29e3277 100644
Binary files a/delete-and-earn/arthur-dolival-delete-and-earn.pdf and b/delete-and-earn/arthur-dolival-delete-and-earn.pdf differ
diff --git a/delete-and-earn/arthur-dolival-delete-and-earn.tex b/delete-and-earn/arthur-dolival-delete-and-earn.tex
index 224dcd7..7586462 100644
--- a/delete-and-earn/arthur-dolival-delete-and-earn.tex
+++ b/delete-and-earn/arthur-dolival-delete-and-earn.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Deletar e Ganhar}{1}{256}{Leetcode 740}
+\begin{ProblemaAutor}{}{Deletar e Ganhar}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em determinar a pontuação máxima que pode ser obtida ao realizar uma série de operações sobre uma sequência de números inteiros. 
 Em cada operação, é possível escolher um número \( x \) da sequência, somar \( x \) pontos ao total e, em seguida, remover \textbf{todos} os elementos iguais a \( x - 1 \) e \( x + 1 \) da sequência. 
@@ -38,5 +38,8 @@ Para o primeiro caso de teste:  \( (3, 4, 5) \), a melhor escolha é remover \(
 Para o segundo caso de teste:  \( (2, 2, 3, 3, 3, 4) \), a melhor estratégia é escolher o número \( 3 \), que concede \( 3 \times 3 = 9 \) pontos, removendo todos os \( 2 \) e \( 4 \); o total máximo é \( 9 \). 
 
 Para o terceiro caso de teste:  \( (1, 2, 3, 4, 5) \), a estratégia ótima é escolher \( 1 \), \( 3 \) e \( 5 \), obtendo \( 1 + 3 + 5 = 9 \) pontos no total.
-\end{ProblemaAutor}
+
+\section*{Observações}
+
+Problema adaptado de \href{https://leetcode.com/problems/delete-and-earn/description/}{Leetcode 740}.\end{ProblemaAutor}
 \end{document}
diff --git a/edit-distance/arthur-dolival-edit-distance-tutorial.pdf b/edit-distance/arthur-dolival-edit-distance-tutorial.pdf
index 7883f43..fa1483d 100644
Binary files a/edit-distance/arthur-dolival-edit-distance-tutorial.pdf and b/edit-distance/arthur-dolival-edit-distance-tutorial.pdf differ
diff --git a/edit-distance/arthur-dolival-edit-distance-tutorial.tex b/edit-distance/arthur-dolival-edit-distance-tutorial.tex
index 490625a..940e2fc 100644
--- a/edit-distance/arthur-dolival-edit-distance-tutorial.tex
+++ b/edit-distance/arthur-dolival-edit-distance-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Distância de Edição}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/edit-distance/arthur-dolival-edit-distance.pdf b/edit-distance/arthur-dolival-edit-distance.pdf
index f38c8a8..0401841 100644
Binary files a/edit-distance/arthur-dolival-edit-distance.pdf and b/edit-distance/arthur-dolival-edit-distance.pdf differ
diff --git a/edit-distance/arthur-dolival-edit-distance.tex b/edit-distance/arthur-dolival-edit-distance.tex
index b72f421..ea1095c 100644
--- a/edit-distance/arthur-dolival-edit-distance.tex
+++ b/edit-distance/arthur-dolival-edit-distance.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Distância de Edição}{1}{256}{}
+\begin{ProblemaAutor}{}{Distância de Edição}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em determinar o \textbf{menor número de operações} necessárias para transformar uma string em outra.
 
diff --git a/estouro/arthur-dolival-estouro-tutorial.pdf b/estouro/arthur-dolival-estouro-tutorial.pdf
index 42cffa3..2b6889c 100644
Binary files a/estouro/arthur-dolival-estouro-tutorial.pdf and b/estouro/arthur-dolival-estouro-tutorial.pdf differ
diff --git a/estouro/arthur-dolival-estouro-tutorial.tex b/estouro/arthur-dolival-estouro-tutorial.tex
index bf7435c..55175f9 100644
--- a/estouro/arthur-dolival-estouro-tutorial.tex
+++ b/estouro/arthur-dolival-estouro-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Estouro}
-\author{Leetcode 312}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/estouro/arthur-dolival-estouro.pdf b/estouro/arthur-dolival-estouro.pdf
index ff10561..262b7eb 100644
Binary files a/estouro/arthur-dolival-estouro.pdf and b/estouro/arthur-dolival-estouro.pdf differ
diff --git a/estouro/arthur-dolival-estouro.tex b/estouro/arthur-dolival-estouro.tex
index a155793..015d9f3 100644
--- a/estouro/arthur-dolival-estouro.tex
+++ b/estouro/arthur-dolival-estouro.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Estouro}{1}{256}{Leetcode 312}
+\begin{ProblemaAutor}{}{Estouro}{1}{256}{Arthur Andrade D'Olival}
 
 No laboratório de experimentos caóticos da \textbf{Fábrica de Balões Numéricos}, um cientista excêntrico te entrega uma fileira de balões, cada um pintado com um número inteiro positivo.
 
@@ -46,5 +46,9 @@ $3 \times 1 \times 5 + 3 \times 5 \times 8 + 1 \times 3 \times 8 + 1 \times 8 \t
 Portanto, o total máximo de energia é $167$.
 
 No segundo exemplo, independentemente da ordem escolhida, a energia total liberada é
-$1 \times 1 \times 5 + 1 \times 5 \times 1 = 10$.\end{ProblemaAutor}
+$1 \times 1 \times 5 + 1 \times 5 \times 1 = 10$.
+
+\section*{Observações}
+
+Problema adaptado de \href{https://leetcode.com/problems/burst-balloons/description/}{Leetcode 312}.\end{ProblemaAutor}
 \end{document}
diff --git a/flowers/arthur-dolival-flowers-tutorial.pdf b/flowers/arthur-dolival-flowers-tutorial.pdf
index fc574e2..bdcafd2 100644
Binary files a/flowers/arthur-dolival-flowers-tutorial.pdf and b/flowers/arthur-dolival-flowers-tutorial.pdf differ
diff --git a/flowers/arthur-dolival-flowers-tutorial.tex b/flowers/arthur-dolival-flowers-tutorial.tex
index 34b2d4c..66253da 100644
--- a/flowers/arthur-dolival-flowers-tutorial.tex
+++ b/flowers/arthur-dolival-flowers-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: O problema das Flores}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/flowers/arthur-dolival-flowers.pdf b/flowers/arthur-dolival-flowers.pdf
index e84a30c..9c8a4ca 100644
Binary files a/flowers/arthur-dolival-flowers.pdf and b/flowers/arthur-dolival-flowers.pdf differ
diff --git a/flowers/arthur-dolival-flowers.tex b/flowers/arthur-dolival-flowers.tex
index 8d8f564..7650725 100644
--- a/flowers/arthur-dolival-flowers.tex
+++ b/flowers/arthur-dolival-flowers.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{O problema das Flores}{1}{256}{}
+\begin{ProblemaAutor}{}{O problema das Flores}{1}{256}{Arthur Andrade D'Olival}
 
 O Jardineiro Bino é conhecido por seus canteiros de flores meticulosamente planejados. Este ano, ele decidiu criar um canteiro linear de comprimento \(n\). Para cada uma das \(n\) posições no canteiro, Bino plantará exatamente uma flor, que pode ser ou vermelha (V) ou branca (B).
 
@@ -13,7 +13,7 @@ Bino está planejando o jardim e quer saber quantas opções de design ele realm
 
 \Entrada
 
-A entrada contém dois inteiros separados por espaço, \(n\) e \(m\), onde \(n\) (\(1 \leq n \leq 10\,000\)) é o comprimento da sequência de flores e  \(m\) (\(1 \leq m \leq 1\,000\)) é o número máximo permitido de flores iguais consecutivas.
+A entrada contém dois inteiros separados por espaço, \(n\) e \(m\), onde \(n\) (\(1 \leq n \leq 1\,000\)) é o comprimento da sequência de flores e  \(m\) (\(1 \leq m \leq 1\,000\)) é o número máximo permitido de flores iguais consecutivas.
 
 \Saida
 
diff --git a/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.pdf b/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.pdf
index 0a35dfe..2ff1949 100644
Binary files a/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.pdf and b/inclusao-de-subintervalos/arthur-dolival-inclusao-de-subintervalos.pdf differ
diff --git a/inclusao-de-subintervalos/inclusao-de-subintervalos.pdf b/inclusao-de-subintervalos/inclusao-de-subintervalos.pdf
index 5355365..cde58e5 100644
Binary files a/inclusao-de-subintervalos/inclusao-de-subintervalos.pdf and b/inclusao-de-subintervalos/inclusao-de-subintervalos.pdf differ
diff --git a/inclusao-de-subintervalos/inclusao-de-subintervalos.tex b/inclusao-de-subintervalos/inclusao-de-subintervalos.tex
index 0c26bec..90f82b8 100644
--- a/inclusao-de-subintervalos/inclusao-de-subintervalos.tex
+++ b/inclusao-de-subintervalos/inclusao-de-subintervalos.tex
@@ -1,5 +1,23 @@
 \documentclass{maratona}
+\usepackage[boxed,algoruled,linesnumbered,vlined,longend]{algorithm2e}
+\SetKwFor{For}{for $($}{$)$}{}
+\SetKwFor{ForAll}{for all $($}{$)$}{}
+\SetKwFor{If}{if $($}{$)$}{}
+\SetKwFor{ElseIf}{else if $($}{$)$}{}
+\newcommand{\Call}[2]{\textsc{#1}(#2)}
+\SetFuncSty{textsc}
+\DontPrintSemicolon
 
+\newenvironment{algoritmo}[1][htbp]
+{
+    \begingroup
+    \renewcommand{\algorithmcfname}{Algoritmo}
+    \begin{algorithm}[#1]
+}
+{
+    \end{algorithm}
+    \endgroup
+}
 \begin{document}
 \begin{ProblemaAutor}{}{Inclusão de Subintervalos}{1}{256}{}
 
@@ -22,6 +40,7 @@ As próximas \( n \) linhas contêm, cada uma, dois inteiros \( l_i \) e \( r_i
 Para cada caso de teste, imprima um único inteiro representando o tamanho do menor conjunto \( S' \subseteq S \) que cobre todos os intervalos de \( S \).
 
 \ExemploEntrada
+
 \begin{Exemplo}
 \texttt{3} & \texttt{3}\\
 \texttt{1~2} & \\
diff --git a/inclusao-de-subintervalos/output/11 b/inclusao-de-subintervalos/output/11
index 482504a..3948aad 100644
--- a/inclusao-de-subintervalos/output/11
+++ b/inclusao-de-subintervalos/output/11
@@ -1 +1 @@
-3994
+3999
diff --git a/inclusao-de-subintervalos/output/12 b/inclusao-de-subintervalos/output/12
index b62c68e..5a95be9 100644
--- a/inclusao-de-subintervalos/output/12
+++ b/inclusao-de-subintervalos/output/12
@@ -1 +1 @@
-2173
+2174
diff --git a/inclusao-de-subintervalos/output/15 b/inclusao-de-subintervalos/output/15
index 9d8f18b..77a45ac 100644
--- a/inclusao-de-subintervalos/output/15
+++ b/inclusao-de-subintervalos/output/15
@@ -1 +1 @@
-12766
+12937
diff --git a/inclusao-de-subintervalos/output/16 b/inclusao-de-subintervalos/output/16
index f2590e7..3e8e9ad 100644
--- a/inclusao-de-subintervalos/output/16
+++ b/inclusao-de-subintervalos/output/16
@@ -1 +1 @@
-7847
+7881
diff --git a/inclusao-de-subintervalos/output/17 b/inclusao-de-subintervalos/output/17
index b704eb2..d346aab 100644
--- a/inclusao-de-subintervalos/output/17
+++ b/inclusao-de-subintervalos/output/17
@@ -1 +1 @@
-10267
+10345
diff --git a/inclusao-de-subintervalos/output/20 b/inclusao-de-subintervalos/output/20
index da5d159..ca96b84 100644
--- a/inclusao-de-subintervalos/output/20
+++ b/inclusao-de-subintervalos/output/20
@@ -1 +1 @@
-28531
+36399
diff --git a/inclusao-de-subintervalos/output/21 b/inclusao-de-subintervalos/output/21
index 540a3b2..7ee24ac 100644
--- a/inclusao-de-subintervalos/output/21
+++ b/inclusao-de-subintervalos/output/21
@@ -1 +1 @@
-27668
+32619
diff --git a/inclusao-de-subintervalos/output/22 b/inclusao-de-subintervalos/output/22
index 3a3b4fc..000d35c 100644
--- a/inclusao-de-subintervalos/output/22
+++ b/inclusao-de-subintervalos/output/22
@@ -1 +1 @@
-27428
+32151
diff --git a/inclusao-de-subintervalos/output/23 b/inclusao-de-subintervalos/output/23
index ce62e4d..5b0ada3 100644
--- a/inclusao-de-subintervalos/output/23
+++ b/inclusao-de-subintervalos/output/23
@@ -1 +1 @@
-27749
+33228
diff --git a/inclusao-de-subintervalos/output/24 b/inclusao-de-subintervalos/output/24
index 47497e8..348d243 100644
--- a/inclusao-de-subintervalos/output/24
+++ b/inclusao-de-subintervalos/output/24
@@ -1 +1 @@
-4267
+4270
diff --git a/inclusao-de-subintervalos/output/25 b/inclusao-de-subintervalos/output/25
index f5bf961..4a0048e 100644
--- a/inclusao-de-subintervalos/output/25
+++ b/inclusao-de-subintervalos/output/25
@@ -1 +1 @@
-28687
+38406
diff --git a/inclusao-de-subintervalos/output/26 b/inclusao-de-subintervalos/output/26
index 366aea3..7e14d76 100644
--- a/inclusao-de-subintervalos/output/26
+++ b/inclusao-de-subintervalos/output/26
@@ -1 +1 @@
-28688
+37218
diff --git a/inclusao-de-subintervalos/output/27 b/inclusao-de-subintervalos/output/27
index f6c96f8..d6c1802 100644
--- a/inclusao-de-subintervalos/output/27
+++ b/inclusao-de-subintervalos/output/27
@@ -1 +1 @@
-28408
+35870
diff --git a/inclusao-de-subintervalos/output/28 b/inclusao-de-subintervalos/output/28
index 960081a..9612261 100644
--- a/inclusao-de-subintervalos/output/28
+++ b/inclusao-de-subintervalos/output/28
@@ -1 +1 @@
-13893
+14128
diff --git a/inclusao-de-subintervalos/output/29 b/inclusao-de-subintervalos/output/29
index 8597e82..367d9af 100644
--- a/inclusao-de-subintervalos/output/29
+++ b/inclusao-de-subintervalos/output/29
@@ -1 +1 @@
-28305
+36385
diff --git a/inclusao-de-subintervalos/output/3 b/inclusao-de-subintervalos/output/3
index 0cfbf08..00750ed 100644
--- a/inclusao-de-subintervalos/output/3
+++ b/inclusao-de-subintervalos/output/3
@@ -1 +1 @@
-2
+3
diff --git a/inclusao-de-subintervalos/output/30 b/inclusao-de-subintervalos/output/30
index 0a5cedf..f9eae87 100644
--- a/inclusao-de-subintervalos/output/30
+++ b/inclusao-de-subintervalos/output/30
@@ -1 +1 @@
-23348
+25202
diff --git a/inclusao-de-subintervalos/output/31 b/inclusao-de-subintervalos/output/31
index c89c49c..09f5e4c 100644
--- a/inclusao-de-subintervalos/output/31
+++ b/inclusao-de-subintervalos/output/31
@@ -1 +1 @@
-27297
+32097
diff --git a/inclusao-de-subintervalos/output/32 b/inclusao-de-subintervalos/output/32
index 4e6f961..6c2ceec 100644
--- a/inclusao-de-subintervalos/output/32
+++ b/inclusao-de-subintervalos/output/32
@@ -1 +1 @@
-25660
+28767
diff --git a/inclusao-de-subintervalos/output/33 b/inclusao-de-subintervalos/output/33
index fe6ed1c..5ccd159 100644
--- a/inclusao-de-subintervalos/output/33
+++ b/inclusao-de-subintervalos/output/33
@@ -1 +1 @@
-20444
+21477
diff --git a/inclusao-de-subintervalos/output/34 b/inclusao-de-subintervalos/output/34
index 503fd39..e36fe86 100644
--- a/inclusao-de-subintervalos/output/34
+++ b/inclusao-de-subintervalos/output/34
@@ -1 +1 @@
-28224
+34785
diff --git a/inclusao-de-subintervalos/output/4 b/inclusao-de-subintervalos/output/4
index 00750ed..b8626c4 100644
--- a/inclusao-de-subintervalos/output/4
+++ b/inclusao-de-subintervalos/output/4
@@ -1 +1 @@
-3
+4
diff --git a/inclusao-de-subintervalos/output/6 b/inclusao-de-subintervalos/output/6
index 7c85d65..13f14be 100644
--- a/inclusao-de-subintervalos/output/6
+++ b/inclusao-de-subintervalos/output/6
@@ -1 +1 @@
-3266
+3268
diff --git a/inclusao-de-subintervalos/output/7 b/inclusao-de-subintervalos/output/7
index 4957109..d7e3a61 100644
--- a/inclusao-de-subintervalos/output/7
+++ b/inclusao-de-subintervalos/output/7
@@ -1 +1 @@
-3378
+3381
diff --git a/inclusao-de-subintervalos/output/8 b/inclusao-de-subintervalos/output/8
index a1de4bf..cc52cd5 100644
--- a/inclusao-de-subintervalos/output/8
+++ b/inclusao-de-subintervalos/output/8
@@ -1 +1 @@
-2509
+2511
diff --git a/inclusao-de-subintervalos/output/9 b/inclusao-de-subintervalos/output/9
index 603c2df..076fe15 100644
--- a/inclusao-de-subintervalos/output/9
+++ b/inclusao-de-subintervalos/output/9
@@ -1 +1 @@
-4084
+4092
diff --git a/inclusao-de-subintervalos/problem.json b/inclusao-de-subintervalos/problem.json
index a523a48..307bf3e 100644
--- a/inclusao-de-subintervalos/problem.json
+++ b/inclusao-de-subintervalos/problem.json
@@ -43,8 +43,8 @@
     },
     "solutions": {
         "main-ac": "ac.cpp",
-        "alternative-ac": [],
-        "wrong-answer": ["WA.cpp"],
+        "alternative-ac": ["caio.cpp"],
+        "wrong-answer": ["wa.cpp"],
         "time-limit": ["TLE.cpp"],
         "time-limit-or-ac": [],
         "time-limit-or-memory-limit": [],
diff --git a/inclusao-de-subintervalos/src/WA.cpp b/inclusao-de-subintervalos/src/WA.cpp
deleted file mode 100644
index da16c19..0000000
--- a/inclusao-de-subintervalos/src/WA.cpp
+++ /dev/null
@@ -1,36 +0,0 @@
-#include <bits/stdc++.h>
-
-using namespace std;
-
-bool comp(pair<int, int> &a, pair<int, int> &b) {
-   if (a.first != b.first) {
-      return a.first < b.first;
-   }
-   return a.second > b.second;
-}
-
-
-int main(){
-   int n; cin >> n;
-
-   vector<pair<int, int>> intervals(n);
-   for (int i = 0; i < n; i++) {
-      cin >> intervals[i].first;
-      cin >> intervals[i].second;
-   }
-
-   sort(intervals.begin(), intervals.end(), comp);
-
-   int lastCovered = intervals[0].second;
-   int count = 1;
-   for (int i = 1; i < n; i++) {
-      if (lastCovered < intervals[i].second) {
-         lastCovered = intervals[i].second;
-         count++;
-      }
-   }
-
-   cout << count << endl;
-
-   return 0;
-}
\ No newline at end of file
diff --git a/inclusao-de-subintervalos/src/ac.cpp b/inclusao-de-subintervalos/src/ac.cpp
index 0ea10e6..da16c19 100644
--- a/inclusao-de-subintervalos/src/ac.cpp
+++ b/inclusao-de-subintervalos/src/ac.cpp
@@ -9,9 +9,6 @@ bool comp(pair<int, int> &a, pair<int, int> &b) {
    return a.second > b.second;
 }
 
-bool intersecting(pair<int, int> &a, pair<int, int> &b) {
-   return a.second >= b.first;
-}
 
 int main(){
    int n; cin >> n;
@@ -24,40 +21,13 @@ int main(){
 
    sort(intervals.begin(), intervals.end(), comp);
 
-   // first sort by start time, if two intervals start at the same time the one with the highest end time comes first
-   // always include the first interval 
-   // keep track of the last included interval so far
-   //    while there are intervals intersecting with the last included interval take the one with the highest ending value
-   //    
-   //    if there is some intersecting interval check if its end time is greater than the last included interval end time, if so include it and update count, else repeat process from the last intersecting interval   
-   //    if no intervals intersect with the last included interval then just process the next interval in order
-
-   // in both cases update the count by 1
-
-   int curInterval = 1, lastIncludedInterval = 0, count = 1;
-   while (curInterval < n) { // curInterval holds the first interval thaat was not processed yet
-      int bestIntersectingInterval = lastIncludedInterval, j = curInterval;
-      while (j < n && intersecting(intervals[lastIncludedInterval], intervals[j])) {
-         int bestEndTime = intervals[bestIntersectingInterval].second;
-         int endTime = intervals[j].second;
-         if (endTime > bestEndTime) {
-            bestIntersectingInterval = j;
-         }
-         j++;
-      }
-
-      if (bestIntersectingInterval != lastIncludedInterval) {
-         lastIncludedInterval = bestIntersectingInterval;
-         count++;
-      } else {
-         if (j == n) break; // this interval alredy covers every remaining interval
-
-         lastIncludedInterval = j;
+   int lastCovered = intervals[0].second;
+   int count = 1;
+   for (int i = 1; i < n; i++) {
+      if (lastCovered < intervals[i].second) {
+         lastCovered = intervals[i].second;
          count++;
       }
-
-      if (curInterval == j) curInterval++;
-      else curInterval = j;
    }
 
    cout << count << endl;
diff --git a/inclusao-de-subintervalos/statement/preamble.tex b/inclusao-de-subintervalos/statement/preamble.tex
index e69de29..f616bb0 100644
--- a/inclusao-de-subintervalos/statement/preamble.tex
+++ b/inclusao-de-subintervalos/statement/preamble.tex
@@ -0,0 +1,19 @@
+\usepackage[boxed,algoruled,linesnumbered,vlined,longend]{algorithm2e}
+\SetKwFor{For}{for $($}{$)$}{}
+\SetKwFor{ForAll}{for all $($}{$)$}{}
+\SetKwFor{If}{if $($}{$)$}{}
+\SetKwFor{ElseIf}{else if $($}{$)$}{}
+\newcommand{\Call}[2]{\textsc{#1}(#2)}
+\SetFuncSty{textsc}
+\DontPrintSemicolon
+
+\newenvironment{algoritmo}[1][htbp]
+{
+    \begingroup
+    \renewcommand{\algorithmcfname}{Algoritmo}
+    \begin{algorithm}[#1]
+}
+{
+    \end{algorithm}
+    \endgroup
+}
\ No newline at end of file
diff --git a/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.pdf b/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.pdf
index 331c241..319dc1b 100644
Binary files a/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.pdf and b/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.pdf differ
diff --git a/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.tex b/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.tex
index 58477ae..e38d26d 100644
--- a/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.tex
+++ b/knapsack-zero-one/arthur-dolival-knapsack-zero-one-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Knapsack Problem}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/knapsack-zero-one/arthur-dolival-knapsack-zero-one.pdf b/knapsack-zero-one/arthur-dolival-knapsack-zero-one.pdf
index ae35a87..f721a5e 100644
Binary files a/knapsack-zero-one/arthur-dolival-knapsack-zero-one.pdf and b/knapsack-zero-one/arthur-dolival-knapsack-zero-one.pdf differ
diff --git a/knapsack-zero-one/arthur-dolival-knapsack-zero-one.tex b/knapsack-zero-one/arthur-dolival-knapsack-zero-one.tex
index a046c18..2eaf61f 100644
--- a/knapsack-zero-one/arthur-dolival-knapsack-zero-one.tex
+++ b/knapsack-zero-one/arthur-dolival-knapsack-zero-one.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Knapsack Problem}{1}{256}{}
+\begin{ProblemaAutor}{}{Knapsack Problem}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em determinar o maior valor total que pode ser obtido ao selecionar um subconjunto de itens para colocar em uma mochila com capacidade limitada. 
 Cada item possui um peso e um valor associados, e a mochila só pode suportar um peso total máximo. 
@@ -11,7 +11,7 @@ Cada item pode ser escolhido no máximo uma vez.
 \Entrada
 
 A entrada é composta por \( N + 1 \) linhas. 
-Na primeira linha, há dois inteiros \( N \) e \( W \) (\( 1 \leq N \leq 100 \), \( 1 \leq W \leq 10^5 \)), representando respectivamente o número de itens e a capacidade máxima da mochila. 
+Na primeira linha, há dois inteiros \( N \) e \( W \) (\( 1 \leq N \leq 100 \), \( 1 \leq W \leq 10^4 \)), representando respectivamente o número de itens e a capacidade máxima da mochila. 
 Cada uma das próximas \( N \) linhas contém dois inteiros \( w_i \) e \( v_i \) (\( 1 \leq w_i \leq W \), \( 1 \leq v_i \leq 10^9 \)), representando respectivamente o peso e o valor do \( i \)-ésimo item.
 
 \Saida
diff --git a/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.pdf b/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.pdf
index c331106..6cf6ecc 100644
Binary files a/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.pdf and b/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.pdf differ
diff --git a/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.tex b/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.tex
index 459bd83..95fcc62 100644
--- a/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.tex
+++ b/longest-common-subsequence/arthur-dolival-longest-common-subsequence-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Maior Subsequência Comum}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/longest-common-subsequence/arthur-dolival-longest-common-subsequence.pdf b/longest-common-subsequence/arthur-dolival-longest-common-subsequence.pdf
index 45507c3..cc5d2e3 100644
Binary files a/longest-common-subsequence/arthur-dolival-longest-common-subsequence.pdf and b/longest-common-subsequence/arthur-dolival-longest-common-subsequence.pdf differ
diff --git a/longest-common-subsequence/arthur-dolival-longest-common-subsequence.tex b/longest-common-subsequence/arthur-dolival-longest-common-subsequence.tex
index 8210d29..75921ba 100644
--- a/longest-common-subsequence/arthur-dolival-longest-common-subsequence.tex
+++ b/longest-common-subsequence/arthur-dolival-longest-common-subsequence.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Maior Subsequência Comum}{1}{256}{}
+\begin{ProblemaAutor}{}{Maior Subsequência Comum}{1}{256}{Arthur Andrade D'Olival}
 
 O objetivo deste problema é determinar o comprimento da \textbf{maior subsequência comum} (Longest Common Subsequence - LCS) entre duas strings fornecidas.
 Uma \textit{subsequência} é uma sequência que pode ser obtida a partir de uma string original removendo-se zero ou mais caracteres, sem alterar a ordem relativa dos caracteres restantes.
diff --git a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.pdf b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.pdf
index 3e8e17e..bfe43f8 100644
Binary files a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.pdf and b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.pdf differ
diff --git a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.tex b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.tex
index 1a4dcf4..4031d4d 100644
--- a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.tex
+++ b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Maior subsequência Crescente II}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.pdf b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.pdf
index 4221a62..64dda58 100644
Binary files a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.pdf and b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.pdf differ
diff --git a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.tex b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.tex
index f1b601f..5de540b 100644
--- a/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.tex
+++ b/longest-increasing-subsequence-II/arthur-dolival-longest-increasing-subsequence-II.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Maior subsequência Crescente II}{1}{256}{}
+\begin{ProblemaAutor}{}{Maior subsequência Crescente II}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em determinar a maior subsequência crescente de uma sequência de números inteiros. 
 Uma subsequência é formada ao remover zero ou mais elementos da sequência original, sem alterar a ordem relativa dos elementos restantes. 
diff --git a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.pdf b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.pdf
index a4e3589..7dd3060 100644
Binary files a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.pdf and b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.pdf differ
diff --git a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.tex b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.tex
index dcedfa9..49e33f7 100644
--- a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.tex
+++ b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Maior subsequência Crescente}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.pdf b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.pdf
index c205b73..4a21e00 100644
Binary files a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.pdf and b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.pdf differ
diff --git a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.tex b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.tex
index 2e49bac..edf9a5d 100644
--- a/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.tex
+++ b/longest-increasing-subsequence/arthur-dolival-longest-increasing-subsequence.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Maior subsequência Crescente}{1}{256}{}
+\begin{ProblemaAutor}{}{Maior subsequência Crescente}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em determinar a maior subsequência crescente de uma sequência de números inteiros. 
 Uma subsequência é formada ao remover zero ou mais elementos da sequência original, sem alterar a ordem relativa dos elementos restantes. 
diff --git a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.pdf b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.pdf
index 83d2655..44921a5 100644
Binary files a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.pdf and b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.pdf differ
diff --git a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.tex b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.tex
index df4eb66..7594367 100644
--- a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.tex
+++ b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Maior Subsequência Palindrômica}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.pdf b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.pdf
index 3c8f3de..dc75c96 100644
Binary files a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.pdf and b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.pdf differ
diff --git a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.tex b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.tex
index 1086723..186a455 100644
--- a/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.tex
+++ b/longest-palindromic-subsequence/arthur-dolival-longest-palindromic-subsequence.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Maior Subsequência Palindrômica}{1}{256}{}
+\begin{ProblemaAutor}{}{Maior Subsequência Palindrômica}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em determinar a maior subsequência palindrômica de uma sequência de caracteres.
 Uma subsequência é formada ao remover zero ou mais elementos da sequência original, sem alterar a ordem relativa dos elementos restantes.
diff --git a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.pdf b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.pdf
index 8185805..c997fcb 100644
Binary files a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.pdf and b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.pdf differ
diff --git a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.tex b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.tex
index 250e8bf..cec9048 100644
--- a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.tex
+++ b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Maximum Subarray Sum}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.pdf b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.pdf
index 5eef335..533bd6b 100644
Binary files a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.pdf and b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.pdf differ
diff --git a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.tex b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.tex
index 36da7f0..34d2471 100644
--- a/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.tex
+++ b/maximum-subarray-sum/arthur-dolival-maximum-subarray-sum.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Maximum Subarray Sum}{1}{256}{}
+\begin{ProblemaAutor}{}{Maximum Subarray Sum}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em determinar a maior soma possível de uma subsequência contínua de uma sequência de números inteiros. 
 Uma subsequência contínua é formada por um ou mais elementos consecutivos da sequência original, sem interrupções. 
diff --git a/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.pdf b/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.pdf
index bbb2630..7d9605a 100644
Binary files a/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.pdf and b/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.pdf differ
diff --git a/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.tex b/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.tex
index 34473a3..5207454 100644
--- a/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.tex
+++ b/min-sum-path-2d/arthur-dolival-min-sum-path-2d-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Caminho de Menor Soma}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/min-sum-path-2d/arthur-dolival-min-sum-path-2d.pdf b/min-sum-path-2d/arthur-dolival-min-sum-path-2d.pdf
index 79c14c3..6920dbc 100644
Binary files a/min-sum-path-2d/arthur-dolival-min-sum-path-2d.pdf and b/min-sum-path-2d/arthur-dolival-min-sum-path-2d.pdf differ
diff --git a/min-sum-path-2d/arthur-dolival-min-sum-path-2d.tex b/min-sum-path-2d/arthur-dolival-min-sum-path-2d.tex
index e4cdb94..6cd536a 100644
--- a/min-sum-path-2d/arthur-dolival-min-sum-path-2d.tex
+++ b/min-sum-path-2d/arthur-dolival-min-sum-path-2d.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Caminho de Menor Soma}{1}{256}{}
+\begin{ProblemaAutor}{}{Caminho de Menor Soma}{1}{256}{Arthur Andrade D'Olival}
 
 O problema consiste em encontrar o menor custo possível para percorrer uma grade de inteiros positivos.
 A grade possui \( n \) linhas e \( m \) colunas, e cada célula contém um valor inteiro positivo que representa o custo de passar por ela.
diff --git a/rod-cutting/arthur-dolival-rod-cutting-tutorial.pdf b/rod-cutting/arthur-dolival-rod-cutting-tutorial.pdf
index a0f303d..32c4547 100644
Binary files a/rod-cutting/arthur-dolival-rod-cutting-tutorial.pdf and b/rod-cutting/arthur-dolival-rod-cutting-tutorial.pdf differ
diff --git a/rod-cutting/arthur-dolival-rod-cutting-tutorial.tex b/rod-cutting/arthur-dolival-rod-cutting-tutorial.tex
index 92d7d8c..b4a20c6 100644
--- a/rod-cutting/arthur-dolival-rod-cutting-tutorial.tex
+++ b/rod-cutting/arthur-dolival-rod-cutting-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Barras e Barras}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/rod-cutting/arthur-dolival-rod-cutting.pdf b/rod-cutting/arthur-dolival-rod-cutting.pdf
index 9920bf0..7098c5f 100644
Binary files a/rod-cutting/arthur-dolival-rod-cutting.pdf and b/rod-cutting/arthur-dolival-rod-cutting.pdf differ
diff --git a/rod-cutting/arthur-dolival-rod-cutting.tex b/rod-cutting/arthur-dolival-rod-cutting.tex
index f82c6cd..df3e5cc 100644
--- a/rod-cutting/arthur-dolival-rod-cutting.tex
+++ b/rod-cutting/arthur-dolival-rod-cutting.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Barras e Barras}{1}{256}{}
+\begin{ProblemaAutor}{}{Barras e Barras}{1}{256}{Arthur Andrade D'Olival}
 
 Dado um pedaço de barra de aço de comprimento \( n \) polegadas, deseja-se cortar essa barra em partes menores de forma a maximizar o lucro total obtido.  
 
diff --git a/subset-sum/arthur-dolival-subset-sum-tutorial.pdf b/subset-sum/arthur-dolival-subset-sum-tutorial.pdf
index 63f69b1..b39f36a 100644
Binary files a/subset-sum/arthur-dolival-subset-sum-tutorial.pdf and b/subset-sum/arthur-dolival-subset-sum-tutorial.pdf differ
diff --git a/subset-sum/arthur-dolival-subset-sum-tutorial.tex b/subset-sum/arthur-dolival-subset-sum-tutorial.tex
index 59147ac..4040922 100644
--- a/subset-sum/arthur-dolival-subset-sum-tutorial.tex
+++ b/subset-sum/arthur-dolival-subset-sum-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Prateleira Dourada}
-\author{}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/subset-sum/arthur-dolival-subset-sum.pdf b/subset-sum/arthur-dolival-subset-sum.pdf
index e867ac7..745a94c 100644
Binary files a/subset-sum/arthur-dolival-subset-sum.pdf and b/subset-sum/arthur-dolival-subset-sum.pdf differ
diff --git a/subset-sum/arthur-dolival-subset-sum.tex b/subset-sum/arthur-dolival-subset-sum.tex
index f85df7e..995c25d 100644
--- a/subset-sum/arthur-dolival-subset-sum.tex
+++ b/subset-sum/arthur-dolival-subset-sum.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Prateleira Dourada}{1}{256}{}
+\begin{ProblemaAutor}{}{Prateleira Dourada}{1}{256}{Arthur Andrade D'Olival}
 
 Você foi recentemente contratado como arquivista júnior na Biblioteca Central, lar de manuscritos inestimáveis. Sua primeira grande tarefa é organizar a famosa \textbf{Prateleira Dourada}, um espaço de exposição reservado apenas para as obras mais raras.
 
diff --git a/unconventional-pairs/arthur-dolival-unconventional-pairs-tutorial.pdf b/unconventional-pairs/arthur-dolival-unconventional-pairs-tutorial.pdf
index c73c419..1ce9329 100644
Binary files a/unconventional-pairs/arthur-dolival-unconventional-pairs-tutorial.pdf and b/unconventional-pairs/arthur-dolival-unconventional-pairs-tutorial.pdf differ
diff --git a/unconventional-pairs/arthur-dolival-unconventional-pairs-tutorial.tex b/unconventional-pairs/arthur-dolival-unconventional-pairs-tutorial.tex
index 206090a..2fb8b61 100644
--- a/unconventional-pairs/arthur-dolival-unconventional-pairs-tutorial.tex
+++ b/unconventional-pairs/arthur-dolival-unconventional-pairs-tutorial.tex
@@ -7,7 +7,6 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Unconventional pairs}
 \author{Codeforces 1054 (Div. 3)}
 \date{}
diff --git a/unconventional-pairs/arthur-dolival-unconventional-pairs.pdf b/unconventional-pairs/arthur-dolival-unconventional-pairs.pdf
index 90de4e5..9f7a842 100644
Binary files a/unconventional-pairs/arthur-dolival-unconventional-pairs.pdf and b/unconventional-pairs/arthur-dolival-unconventional-pairs.pdf differ
diff --git a/vacations/arthur-dolival-vacations-tutorial.pdf b/vacations/arthur-dolival-vacations-tutorial.pdf
index 6b335c0..96d7a67 100644
Binary files a/vacations/arthur-dolival-vacations-tutorial.pdf and b/vacations/arthur-dolival-vacations-tutorial.pdf differ
diff --git a/vacations/arthur-dolival-vacations-tutorial.tex b/vacations/arthur-dolival-vacations-tutorial.tex
index a1febb4..85c8a64 100644
--- a/vacations/arthur-dolival-vacations-tutorial.tex
+++ b/vacations/arthur-dolival-vacations-tutorial.tex
@@ -7,9 +7,8 @@
 \usepackage{hyperref}
 \usepackage{graphicx}
 \input{statement/preamble.tex}
-
 \title{ Tutorial: Férias}
-\author{Codeforces 363 (Div. 1)}
+\author{Arthur Andrade D'Olival}
 \date{}
 \begin{document}
 \maketitle
diff --git a/vacations/arthur-dolival-vacations.pdf b/vacations/arthur-dolival-vacations.pdf
index d6b0249..6a2999f 100644
Binary files a/vacations/arthur-dolival-vacations.pdf and b/vacations/arthur-dolival-vacations.pdf differ
diff --git a/vacations/arthur-dolival-vacations.tex b/vacations/arthur-dolival-vacations.tex
index 34b61e4..d73fab9 100644
--- a/vacations/arthur-dolival-vacations.tex
+++ b/vacations/arthur-dolival-vacations.tex
@@ -1,7 +1,7 @@
 \documentclass{maratona}
 
 \begin{document}
-\begin{ProblemaAutor}{}{Férias}{1}{256}{Codeforces 363 (Div. 1)}
+\begin{ProblemaAutor}{}{Férias}{1}{256}{Arthur Andrade D'Olival}
 
 Miguel tem \(n\) dias de férias e pretende aproveitá-los para estudar programação e também praticar esportes. Para cada um desses dias, ele sabe antecipadamente duas informações: se a academia estará aberta e se haverá uma competição online disponível. Assim, cada dia se enquadra em uma das quatro situações possíveis: sem academia e sem competição, sem academia mas com competição, com academia mas sem competição, ou com ambos disponíveis.
 
@@ -44,5 +44,9 @@ No primeiro caso de teste, Miguel pode participar da competição no dia 1 e ir
 
 No segundo caso de teste, Miguel pode participar da competição nos dias 1, 3, 5 e 7 e ir à academia nos demais.
 
-No terceiro caso de teste, como Miguel não pode ir à academia em dois dias seguidos ele será obrigado a descansar em um dos dias.\end{ProblemaAutor}
+No terceiro caso de teste, como Miguel não pode ir à academia em dois dias seguidos ele será obrigado a descansar em um dos dias.
+
+\section*{Observações}
+
+Problema adaptado de \href{https://codeforces.com/contest/699/problem/C}{Codeforces 363 (Div. 1, Problem C)}.\end{ProblemaAutor}
 \end{document}