atcoder — D — Small Multiple

Правка en1, от egor.okhterov, 2017-11-05 01:47:29

Today I wasn't able to solve the problem D — Small Multiple.
For the whole contest I thought that it is some kind of DP problem, but then I looked at the editorial and it turned out to be a graph problem O_o.

I started looking at the code of the people who solved it and I found out that they are implementing the same idea (more or less). Particularly, I like this solution.

  • Is it some kind of a standard problem/idea?
  • Does anyone know where I can read about it more abstractly?
  • Does anyone know some similar problems that require the same approach?
Теги 0-1 bfs, bfs

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en3 Английский egor.okhterov 2017-11-20 16:32:38 54 Tiny change: 'NUMBER/) ' -> 'NUMBER/) \n4. [Sums](http://main.edu.pl/en/archive/oi/10/sum) '
en2 Английский egor.okhterov 2017-11-05 18:59:54 317 Added problems to practice
en1 Английский egor.okhterov 2017-11-05 01:47:29 763 Initial revision (published)