Cod sursa(job #2926503)

Utilizator NToniBoSSNicolae Tonitza NToniBoSS Data 17 octombrie 2022 21:17:16
Problema Pavare2 Scor 0
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 0.62 kb
#include <bits/stdc++.h>
#define MOD 666013
/// TONI BO$$ was here
/// #MLC

using namespace std;

int dp[1000001][2];

int main()
{
    int i, p, q, n, sum;
    freopen("unuzero.in","r",stdin);
    freopen("unuzero.out","w",stdout);
    scanf("%d%d%d", &n, &p, &q);
    dp[0][0] = 1;
    sum = 0;
    for(i = 1; i <= n; i++)
    {
        dp[i][0] = (dp[i - 1][0] + dp[i - 1][1]) % MOD;
        if(i >= p) sum = (sum + dp[i - p][0]) % MOD;
        if(i >= q + 1) sum = (sum - dp[i - q - 1][0] + MOD) % MOD;
        dp[i][1] = sum;
    }
    printf("%d\n", (dp[n][0] + dp[n][1] - 1) % MOD);

    return 0;
}