atcoder — D — Small Multiple

Revision en3, by egor.okhterov, 2017-11-20 16:32:38

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?

Here I'll keep the list of problems to train this idea:
1. D — Small Multiple
2. 0-K Multiple
3. INUMBER — Interesting number
4. Sums

Tags 0-1 bfs, bfs


  Rev. Lang. By When Δ Comment
en3 English egor.okhterov 2017-11-20 16:32:38 54 Tiny change: 'NUMBER/) ' -> 'NUMBER/) \n4. [Sums]( '
en2 English egor.okhterov 2017-11-05 18:59:54 317 Added problems to practice
en1 English egor.okhterov 2017-11-05 01:47:29 763 Initial revision (published)