Pagini recente » Cod sursa (job #1477425) | Cod sursa (job #3181740) | Cod sursa (job #130411) | Cod sursa (job #2844120) | Cod sursa (job #767257)
Cod sursa(job #767257)
#include <fstream>
using namespace std;
ifstream fin ("divk.in");
ofstream fout ("divk.out");
int v[50007],m[5007][5007];
int main()
{
int n,a,b,k,i,nr,j,rest=0;
fin>>n>>k>>a>>b;
for (i=1;i<=n;i++)
{
fin>>v[i];
}
nr=0;
for (i=0;i<n;i++)
for (j=1;j<=i;j++)
m[i][j]=i&&j;
for (j=0;j<=n;j++)
m[j][1]=v[j];
for(i=2;i<=n;i++)
{
for (j=2;j<=i;j++)
{
rest=(m[i-1][j-1]+v[i])%k;
if(!rest&&j>=a&&j<=b)
{
nr++;
}
m[i][j]=rest;
}
}
fout<<nr;
return 0;
}