Pagini recente » Cod sursa (job #899633) | Cod sursa (job #3194811) | Cod sursa (job #2819038) | Cod sursa (job #2531985) | Cod sursa (job #2037338)
//15 pct
#include <bits/stdc++.h>
#define Kmax 21
#define Mmax 1001
#define MOD 9901
#define pb push_back
using namespace std;
ifstream f("pod.in");
ofstream g("pod.out");
int good[Mmax];
deque <int> dq;
int main()
{
int n,m,k,i,x;
f>>n>>m>>k;
for(i=1;i<=m;i++)
f>>good[i];
sort(good+1,good+m+1);
int poz=1;
dq.pb(1);
for(i=1;i<k;i++)
if(i==good[poz])
{
++poz;
dq.pb(0);
}
else
dq.pb(dq.back());
for(i=k;i<=n;i++)
{
x=(dq.front()+dq.back())%MOD;
if(i==good[poz])
{
++poz;
x=0;
}
dq.pb(x);
dq.pop_front();
}
g<<dq.back();
return 0;
}