Codeforces 455A Boredom - Base Cases - 1D DP | Dynamic Programming

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/dynamic-programming/1d-dp/boredom-basecases

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░████████████████████████████████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/roadmaps/dynamic-programming/1d-dp/boredom-basecases

Repovive

Codeforces 455A Boredom - Base Cases - 1D DP | Dynamic Programming | Repovive

3.3.3. Set the base cases You need to define dp[0]dp[0]dp[0] and dp[1]dp[1]dp[1]. There are no positive numbers when you only consider values up to 000, so dp[0]=0.dp[0] = 0.dp[0]=0. When you consider values up to 111, the only possible value is 111.

$3.$ Set the base cases You need to define $dp[0]$ and $dp[1]$ . There are no positive numbers when you only consider values up to $0$ , so $dp[0] = 0.$ When you consider values up to $1$ , the only possible value is $1$ .