Graph,Dynamic Programming & Bitmasks

Правка en1, от resad, 2023-03-06 22:13:58

Hello to everyone! I started competitive programming for about 3-4 months, I don't have many problems in other subjects, but bitmask, dp, graph were the subjects I had the most difficulty in. I have a relatively difficult time understanding graph questions, and I don't have the resources to learn about bitmask and dp in general. One of the things I don't understand is dp bitmask questions. Do you need to learn ready-made functions to work or do you need to write your own solution for each question? How can I get stronger in the graph? I would appreciate it if you could help me with this

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский resad 2023-03-06 22:13:58 633 Initial revision (published)