Please read the new rule regarding the restriction on the use of AI tools. ×

apamineralasauplata's blog

What's the most advanced / unknown Data Structure / Algorithm / Trick you know?
By apamineralasauplata, history, 13 months ago, In English

For me it is this one.

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

Comments Comments (21)
| Write comment?
»
13 months ago, # |
  Vote: I like it +8 Vote: I do not like it

kinetic segtree

→ Reply
»
13 months ago, # |
  Vote: I like it +10 Vote: I do not like it

For me it's the Round-Square Tree data structure. I use it almost every day but not many people know about it.

→ Reply
»
13 months ago, # |
  Vote: I like it -26 Vote: I do not like it

Implicit Persistent Treap Beats. UUUU

→ Reply
»
13 months ago, # |
  Vote: I like it +17 Vote: I do not like it

Putting my fist into my mouth

→ Reply
»
13 months ago, # |
  Vote: I like it +20 Vote: I do not like it

How to mod multiply two large numbers in C++.

→ Reply
»
13 months ago, # |
  Vote: I like it +34 Vote: I do not like it

bitset

→ Reply
»
13 months ago, # |
  Vote: I like it +15 Vote: I do not like it

For me it's this

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Segment tree, but get this: with lazy propagation

Also bitwise trie (if you consider that more advaned than the segment tree)

→ Reply
»
13 months ago, # |
  Vote: I like it +3 Vote: I do not like it

math

→ Reply
»
13 months ago, # |
  Vote: I like it +7 Vote: I do not like it

Binary Search

→ Reply
»
13 months ago, # |
  Vote: I like it +2 Vote: I do not like it

You know algorithm floyd? Most of people just memorize it without understading and there is a special order of for's ( loops ). But instead of memorizing the correct order you can just write them in random order and copy past it three times in you code it will work correctly!

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

virtual tree / auxiliary tree (however I like to call it an LCA tree)

→ Reply
»
13 months ago, # |
  Vote: I like it +7 Vote: I do not like it

Binary search

→ Reply
»
13 months ago, # |
  Vote: I like it +19 Vote: I do not like it

Let $$$f(x)$$$ be a polynomial with non-negative integer coefficients for which $$$f(10)$$$ is prime. If the coefficients of $$$f(x)$$$ are at most $$$49598666989151226098104244512918$$$, then $$$f(x)$$$ is irreducible.

I hope I will get to use this theorem in a real programming contest one day :(

→ Reply
»
13 months ago, # |
  Vote: I like it +23 Vote: I do not like it

Stop stressing over so much for EJOI. You don't need to learn anything new. Graph bundling

→ Reply
»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Lagrange interpolation

→ Reply