adicionando soluções java e py

This commit is contained in:
2026-10-28 15:42:27 -03:00
parent d860dd2f7a
commit eefcf7cf4e
106 changed files with 143 additions and 62 deletions

View File

@@ -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}{}

View File

@@ -19,7 +19,7 @@
\endgroup
}
\begin{document}
\begin{ProblemaAutor}{}{Inclusão de Subintervalos}{1}{256}{}
\begin{ProblemaAutor}{}{Inclusão de Subintervalos}{1}{256}{Arthur Andrade D'Olival}
Seja \( S \) um conjunto de \( n \) intervalos sobre a reta real \( ([l_0, r_0], [l_1, r_1], \ldots, [l_{n-1}, r_{n-1}]) \), de modo que, para todo intervalo \( [l_i, r_i] \), temos \( l_i \le r_i \).

View File

@@ -2,7 +2,7 @@
"version": "1.0",
"problem": {
"title": "Inclusão de Subintervalos",
"event": "",
"event": "DS Contest-Tools",
"time_limit": 1.0,
"memory_limit_mb": 256,
"input_file": "stdin",
@@ -26,7 +26,7 @@
}
},
"author": {
"name": "",
"name": "Arthur Andrade D'Olival",
"affiliation": "",
"country": "",
"email": ""
@@ -40,7 +40,7 @@
"run_specific_solution": "",
"generate_io_only": false,
"generate_pdf_only": false,
"cpu_count": 1,
"cpu_count": 0,
"build_pdf": true,
"pdf_format": "ds",
"io_samples": 2
@@ -49,7 +49,8 @@
"main-ac": "ac.cpp",
"alternative-ac": [
"caio.cpp",
"saad.py"
"saad.py",
"luma.py"
],
"wrong-answer": [
"wa.cpp"