killforcode's blog

Good Problems for LGMs to do !!!!!
By killforcode, history, 5 years ago, In English
  1. Cut Length Geomtry Problem F
  2. Edge Coloring in Bipartite Graph Problem F
  3. Minimum spanning tree for each edge
  4. Frogs and mosquitoes
  5. Expensive Strings
  6. Sorted and Sorted
  7. Complete Compress
  8. Xor Shift -- (String Algorithm , Check CPC for the other explaination)
  9. Xors on Segments
  10. The Sum of the k-th Powers
  11. Thief in a Shop ---- ( FFT )
  12. Magic Matrix
  13. Ants on a Circle
  14. Four Divisors
  15. Lena and Queries
  16. T-Shirts — ( Data Structures)
  17. Two Arithmetic Progressions ---- ( Number Thory Algorithms)
  18. String Set Queries ---- (Aho-Corasik algorithm )
  19. Tree nesting -- (DP , bitmask , center of Tree)
  20. Periodic RMQ Problem ---- (Advanced Compression Seg Tree)
  21. Card Game ----- (Flows)
  22. Anthem of Berland ----- (Prefix Function , KMP Algorithm)
  23. Mages and Monsters
  24. Bear and Bowling 4
  25. Counting on a Tree --(Hard Seg Tree)
  26. Easy Queries --(Hard Seg Tree)
  • Vote: I like it
  • -18
  • Vote: I do not like it

»
5 years ago, # |
  Vote: I like it 0 Vote: I do not like it

I am on it

→ Reply