2560번: 짚신벌레 (실패)

#include <iostream>

using namespace std;

int main()

{

int a, b, d, N, adt = 0, liv = 1;

cin >> a >> b >> d >> N;

int day[10000];

for (int i = 1; i < 10000; ++i)

day[i] = 0;

day[0] = 1;

for (int i = 1; i < N+1; ++i)

{

for (int j = d; j > 0; --j)

{

day[j] = day[j-1];

}

adt = adt + day[a] - day[b];

day[0] = adt;

liv = liv + day[0] - day[d];

}

cout << liv % 1000;

}