G - The Debut Album （dfs）

Pop-group “Pink elephant” entered on recording their debut album. In fact they have only two songs: “My love” and “I miss you”, but each of them has a large number of remixes.

The producer of the group said that the album should consist of n remixes. On second thoughts the musicians decided that the album will be of interest only if there are no more than a remixes on “My love” in a row and no more than b remixes on “I miss you” in a row. Otherwise, there is a risk that even the most devoted fans won’t listen to the disk up to the end.

How many different variants to record the album of interest from n remixes exist? A variant is a sequence of integers 1 and 2, where ones denote remixes on “My love” and twos denote remixes on “I miss you”. Two variants are considered different if for some i in one variant at i-th place stands one and in another variant at the same place stands two.

Input

The only line contains integers n, a, b (1 ≤ a, b ≤ 300; max( a, b) + 1 ≤ n ≤ 50 000).

Output

Output the number of different record variants modulo 10 9+7.

Example

input	output
3 2 1	4

Notes

In the example there are the following record variants: 112, 121, 211, 212.

题目大意：在n个位置上填1或2，,1的连续片段不超过a个，2的连续片段不超过b个，问有多少种方案数

思路概括：dfs跑所有的可能性，注意取模

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdlib>
#include<ctime>
#include<deque>
#include<iomanip>
#include<list>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<vector>
using namespace std;
typedef long long ll;
const double pi = acos(-1.0);
const ll mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const int maxn = 5e4 + 50;
ll dp[maxn][2];
ll n, a, b;
ll dfs(ll pos, bool x)
{
    if(pos == 0) return 1;
    if(dp[pos][x] != -1) return dp[pos][x];
    ll ans = 0;
    if(x)
    {
        for(int i=max(pos - a, ll(0));i<pos;i++)
        {
            ans = (ans + dfs(i, 0)) % mod;
        }
    }
    else
    {
        for(int i=max(pos - b, ll(0));i<pos;i++)
        {
            ans = (ans + dfs(i, 1)) % mod;
        }
    }
    return dp[pos][x] = ans;
}
int main()
{
    cin >> n >> a >> b;
    memset(dp, -1, sizeof(dp));
    cout << (dfs(n, 1) + dfs(n, 0)) % mod << endl;
    return 0;
}