Good Bye 2017 D - New Year and Arbitrary Arrangement

#include<iostream>
#include<algorithm>
#include<iomanip>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<set>
#include<queue>
#include<stack>
#include<map>
#define PI acos(-1.0)
#define in freopen("in.txt", "r", stdin)
#define out freopen("out.txt", "w", stdout)
#define kuaidian ios::sync_with_stdio(0);

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxn = 1500 + 7, maxd = 1e5 + 7;
const int mod = 1e9 + 7;
const int INF = 0x7f7f7f7f;

ll k, pa, pb;
ll dp[maxn][maxn];

int f_pow(ll x, ll n) {
    ll res = 1;
    while(n) {
        if(n&1) res = (res * x) % mod;
        x = (x * x) % mod;
        n /= 2;
    }
    return res;
}

int inv(ll x) {
    return f_pow(x, mod-2);
}

ll solve(ll i, ll j) {
    if(i + j >= k) {
        return (i + j + pa*inv(pb)%mod) % mod;
    }
    if(dp[i][j] != -1) {
        return dp[i][j];
    }
    return dp[i][j] = (pa*solve(i+1, j)%mod + pb*solve(i, j+i)%mod) * inv(pa+pb) % mod;
}

int main() {

    scanf("%lld%lld%lld", &k, &pa, &pb);
    memset(dp, -1, sizeof dp);
    printf("%lld", solve(1, 0));

    return 0;
}