Pagini recente » Cod sursa (job #139724) | Cod sursa (job #2839944) | Cod sursa (job #1993367) | Cod sursa (job #2550337) | Cod sursa (job #2037296)
#include <fstream>
#include <algorithm>
using namespace std;
int n,m,k;
int v[30], b[1003];
ifstream f("pod.in");
ofstream g("pod.out");
#define mod 9901
int main()
{
int i,j,w,t,o,a;
f>>n>>m>>k;
for(i=1;i<=m;i++)
f>>b[i];
v[0]=1;
for(int q=1;q<=n;q++)
{
w=q%k;
a=0;
if(q==5)
o=1;
if(w==0)
w=k;
if(!binary_search(b+1,b+m+1,q))
{
a=0;
for(t=0;t<=w;t++)
if(!binary_search(b+1,b+m+1,q-(w-t)))
a+=v[t];
for(t=w+1;t<k;t++)
if(!binary_search(b+1,b+m+1,q-t))
a+=v[t];
/*if(!binary_search(b+1,b+m+1,q-k))
a+=v[0];*/
}
if(w==k)
w=0;
v[w]=a%mod;
}
g<<v[n%k];
return 0;
}