6A - Daydreamin

#include <iostream>
#include <cstdio>
using namespace std;
typedef long long ll;

ll dp[];  // 第i天为晴天的概率
ll mod = ;

ll mulMod(ll a, ll b)
{
    return (a % mod) * (b % mod) % mod;
}

ll plusMod(ll a, ll b)
{
    return (a % mod + b % mod) % mod;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie();

    ll n, m, p, d, a, b, c;
    cin >> n >> m >> p >> d >> a >> b >> c;
    dp[] = ;  // 第一天为晴天
    ll ans = ;
    ll k = plusMod(mulMod(d, c), mulMod( - d + mod, b)); // 台风天狩猎b和c的期望
    // 前m天中第i天是晴天，之前必为晴天
    for (int i = ; i <= m; i++) {
        dp[i] = mulMod(dp[i - ],  - p + mod);
        ans = plusMod(ans, plusMod(dp[i] * a, ( - dp[i] + mod) * k));
    }
    for (int i = m + ; i <= n; i++) {
        dp[i] = plusMod(mulMod(dp[i - ],  - p + mod), mulMod(dp[i - m - ], p));
        ans = plusMod(ans, plusMod(dp[i] * a, ( - dp[i] + mod) * k));
    }
    cout << ans << endl;
}