Pagini recente » Cod sursa (job #3198335) | Cod sursa (job #448475) | Cod sursa (job #553056) | Cod sursa (job #1266960) | Cod sursa (job #2490752)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("pod.in");
ofstream g("pod.out");
vector<int>imposibil;
const int mod=9901;
int n, m, k,x, auxk, ind;
int dp[25];
void solve()
{
dp[0]=1;
for (int i=1; i<=n; ++i)
{
if (imposibil[ind]==i)
{dp[i%auxk]=0;
++ind;
}
else
{
dp[i%auxk]=0;
if (i-k>=0)
{
dp[i%auxk]+=dp[(i-k)%auxk];
}
dp[i%auxk]+=dp[(i-1)%auxk];
dp[i%auxk]%=mod;
}
}
g << dp[n%auxk];
}
int main( )
{
f >> n >> m >> k;
for (int i=1; i<=m; ++i)
{
f >> x;
imposibil.push_back(x);
}
auxk=k+1;
imposibil.push_back(0);
solve();
return 0;
}