from Algorithm Practical Skill Test

D

  • Only a few thousand cases even if made naively because of the small size.

E

  • It is a directed graph with no confluence
  • Find the least common multiple for the period of a cycle

F

  • Always make the best choice at the time.

G


This page is auto-translated from [/nishio/第二回 アルゴリズム実技検定](https://scrapbox.io/nishio/第二回 アルゴリズム実技検定) using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.