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

feat: new greedy problem formated

Browse Source
This commit is contained in:
arthur
2026-02-05 23:10:20 -03:00
parent 0f4e453c07
commit a3f93d2e59
143 changed files with 859320 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

1
unconventional-pairs/statement/output.tex Normal file
View File

@@ -0,0 +1 @@
Para cada caso de teste, imprima um único número inteiro representando o \textbf{valor mínimo possível da diferença máxima} entre os elementos de todos os pares formados.