Pagini recente » Borderou de evaluare (job #1769178) | Borderou de evaluare (job #2093732) | Borderou de evaluare (job #385364) | Borderou de evaluare (job #3278329) | Cod sursa (job #466999)
Cod sursa(job #466999)
using namespace std;
#include<iostream>
#include<fstream>
#include<bitset>
#define MOD 9901
bitset<4000000> hash;
short dp[1000000];
int M,N,K;
ofstream fout("pod.out");
void solve()
{int i;
dp[0]=1;
for(i=0;i<=N;i++)
{
if(hash[i+1]==1)
dp[i+1]=0;
else
{dp[i+1]+=dp[i];
dp[i+K]%=MOD;}
if(hash[i+K]==1)
dp[i+K]=0;
else
{dp[i+K]+=dp[i];
dp[i+K]%=MOD;
}
}
fout<<dp[N]<<"\n";
}
void cit()
{int x,i;
ifstream fin("pod.in");
fin>>N>>M>>K;
for(i=1;i<=M;i++)
{fin>>x;
hash[x]=1;
}
fin.close();
}
int main()
{
cit();
solve();
fout.close();
return 0;
}