Please subscribe to the official Codeforces channel in Telegram via the link https://t.me/codeforces_official. ×

Can we have better solution than O(n^2 log n) for the following problem 1.

Revision en1, by pkpawan, 2022-06-21 18:32:15

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English pkpawan 2022-06-21 18:32:15 207 Initial revision (published)