killforcode's blog

By killforcode, 2 months ago, In English,
  1. Pursuit For Artifacts ----- ( SCC , BiConnected , Bridges , Very good Question)
  2. Beautiful Subarrays ---- ( Trie DataStructure , Helpful Quora Blog )
  3. Another Sith Tournament ----- ( DP + bitmasks , Hamiltonian Cycle , https://codeforces.com/blog/entry/337 , For more refer Learnt Doc)
  4. Analysis of Pathes in Functional Graph ------ (Binary Exponentational , Very Very good application of the power of a series)
  5. Generate a String ---- ( For Proof of DP Solution , Please see my Comment in the Editorial Blog(taken from Aryaman))
  6. Maximum path ---- Very Nice Explanation ----- ( Very Good Dynamic Programming for Optimal Path Problem , they rarely make as good as this problems now , Definatelyyyyy REVISE)
  7. Radio stations -- ( Seg Tree , sort data and apply in order ,Similar Problem — Zbazi in Zeydabad )
  8. Array Queries — ( Using two different ways of compution and combining together to get best complexity , Very Neat Trick to Learn)
  9. Mice and Holes — (Very Good Dynamic Programming Problem , optimize DP using a variety of things , either we can optimize it using a set (Similar Problem — TRIPPY Solution ) or using the Sliding Window Minimum Algorithm CP-handbook Pg 81 .)
  10. Anthem of Berland — ( VEry Very Good Problem on Prefix Function , uses the Prefix Function Automaton. Uses DP to optimize further. Solution )
 
 
 
 
  • Vote: I like it
  • -31
  • Vote: I do not like it

»
2 months ago, # |
  Vote: I like it +32 Vote: I do not like it

»
2 months ago, # |
  Vote: I like it +3 Vote: I do not like it

I think these problems are quite easy for even a candidate master.

  • »
    »
    2 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    For even a CM ? , They are 2200-2300 rated problems. They should be challenging for a CM.