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

feat: new Divide and Conquer problem partialy formated.

Browse Source
This commit is contained in:
arthur
2026-02-23 22:51:03 -03:00
parent 81a0762a86
commit b9a96ddc83
18 changed files with 6517 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

5
dominancia-de-pontos/statement/input.tex Normal file
View File

@@ -0,0 +1,5 @@
A entrada consiste em um único caso de teste.
A primeira linha contém um inteiro \( n \) (\( 1 \le n \le 10^5 \)), representando o número de pontos no conjunto.
As próximas \( n \) linhas contêm, cada uma, dois inteiros \( x_i \) e \( y_i \) (\( -10^9 \le x_i, y_i \le 10^9 \)), representando as coordenadas de cada ponto.