danielsaad/problemas-para-competicao-pibiti-arthur-dolival
2
0
Fork 0
Code Issues 1 Pull Requests Actions Packages Projects Releases Wiki Activity

feat(DP): new dp problems formated

Browse Source
This commit is contained in:
arthur
2025-11-04 21:14:50 -03:00
parent 669c13147b
commit 3b03c32703
925 changed files with 30660 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

3
flowers/statement/input.tex Normal file
View File

@@ -0,0 +1,3 @@
A entrada contém dois inteiros separados por espaço: \(n\) e \(m\).
\(n\) (\(1 \leq n \leq 10^4\)) é o comprimento da sequência de flores.
\(m\) (\(1 \leq m \leq 1000\)) é o número máximo permitido de flores iguais consecutivas.