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

me_nub's blog

By me_nub, 2 months ago, In English

I was saw this problem and it's efficient approach. Turns out that this is only efficient and not accurate. I was wondering if this can be solved in less than O(n^2) ?

Read more »

 
 
 
 
  • Vote: I like it
  • +10
  • Vote: I do not like it

By me_nub, history, 11 months ago, In English

Is this the same for everybody? The text is from 1337D - Xenia and Colorful Gems

image

Read more »

 
 
 
 
  • Vote: I like it
  • +18
  • Vote: I do not like it