aoc-2024-12-07_overslept.cpp

Поделиться
HTML-код
  • Опубликовано: 31 дек 2024

Комментарии • 3

  • @A57278
    @A57278 24 дня назад +1

    what 's your job ?

  • @Entertainmentexe
    @Entertainmentexe 25 дней назад

    Can you please explain the time complexity of your solution?

    • @Golovanov399
      @Golovanov399  25 дней назад

      @@Entertainmentexe no (at most 3^{n-1}, but in reality probably much less because most of the time there is only one valid transition)