Mhn_Neek's blog

Finding a problem judge
By Mhn_Neek, history, 4 hours ago, In English

The problem is about counting the number of strings of size $$$n$$$ consisting of $$$'a'$$$ and $$$'b'$$$ such that for any substring of the string, the absolute difference between the number of $$$'a'$$$ s and $$$'b'$$$ s is less than $$$k$$$.

  • Vote: I like it
  • -6
  • Vote: I do not like it

»
3 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

what are the constraints?

→ Reply
  • »
    »
    3 hours ago, # ^ |
      Vote: I like it -10 Vote: I do not like it

    I don't want you to solve the problem. Just find the judge.

    $$$n,k$$$ $$$\leq$$$ 1000

    → Reply
    • »
      »
      »
      2 hours ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      Actually, the solution and the checker here should be the same, unless, of course, if you are fine with having a greedy checker.

      → Reply
      • »
        »
        »
        »
        2 hours ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

        I have already solved the problem :|
        I want to find the source!

        → Reply
        • »
          »
          »
          »
          »
          9 minutes ago, # ^ |
            Vote: I like it 0 Vote: I do not like it

          maybe there is no source!

          → Reply