Codeforces Round 1133 (Div. 1, Div. 2) is coming soon! Register here. ×

fatespeaker's blog

Halloween 2026
By fatespeaker, 5 weeks ago, In English

Hello Codeforces!

Halloween is coming up soon, and I have no idea what a good costume would be. Last year, I was a segment tree.

Spoiler

Well, it is now a new year, so it is time for a new costume. I've decided to be whatever the most upvoted comment (with my approval) suggests me to be. I'm expecting competitive programming related responses.

I'll make sure to share my costume for this year once it's created.

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

»
5 weeks ago, hide # |
 
Vote: I like it +85 Vote: I do not like it

fft

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

kid who's blue, who each day throws div2

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +18 Vote: I do not like it

Meow

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

fenwick tree

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

HLD

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Treap / Splay tree

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

red-black tree

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

queap

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Li Chao Tree

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

lca please

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

You should dress up as a dfs cus the costume should be scary (bfs mogs)

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Number 10^9 + 7

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Matroid

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I'm LCT, I found nothing to deal with recently,what should I do?

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +48 Vote: I do not like it

Alien trick

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

qrioritypueue

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Persistent Segment Tree, ConvexHull or anything complex.

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Round-square tree

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Be a segfault

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

yuanfeng tree

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

The Bellman–Ford–Moore Algorithm (with Shortest Path Faster Algorithm / SPFA optimization)

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

you should dress up as a "Time Limit Exceeded on Test 97"

→ Reply
»
5 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

dress up as tourist

→ Reply