B Think-cell round 1

Revision en2, by Axial-Tilted, 2024-02-18 02:41:22

how would you write a checker for problem B from the contest Think-cell round 1 with complexity less than n^2 ?

in others words given a permutation of size n determine weather there exists 2 indices i and j (1 <= i,j <n) i != j , where p(i) devides p(j) and p(i+1) devides p(j+1)

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Axial-Tilted 2024-02-18 02:41:22 171
en1 English Axial-Tilted 2024-02-18 02:34:26 131 Initial revision (published)