Secret of Chocolate Poles Gym - 101986A

https://cn.vjudge.net/problem/Gym-101986A

思路：dp[i][j]表示i（0/1）顶是黑还是白，j表示当前长度；

#include <iostream>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
#include <cstdio>
//#include<bits/stdc++.h>
using namespace std;

#define sfi(i) scanf("%d",&i)
#define sfs(i) scanf("%s",(i))
#define pri(i) printf("%d\n",i)
#define sff(i) scanf("%lf",&i)
#define ll long long
#define ull unsigned long long
#define mem(x,y) memset(x,y,sizeof(x))
#define INF 0x3f3f3f3f
#define eps 1e-10
#define PI acos(-1.0)
#define lowbit(x) ((x)&(-x))
#define zero(x) (((x)>0?(x):-(x))<eps)
#define fl() printf("flag\n")
#define MOD(x) ((x%mod)+mod)%mod
#define endl '\n'
#define pb push_back
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)

const int maxn=1e5+9;

int l,k;
ll ans=0;
ll dp[2][109];
int main()
{
    //FAST_IO;

    //freopen("input.txt","r",stdin);

    cin>>l>>k;

    dp[1][1]=1;
    dp[1][k]=1;

    for(int i=1;i<=l;i++)
    {

        dp[0][i]+=dp[1][i-1];

        if(i>=k)
            dp[0][i]+=dp[1][i-k];
        dp[1][i]+=dp[0][i-1];
    }

    for(int i=1;i<=l;i++) ans+=dp[1][i];
    cout<<ans<<endl;

    return 0;
}