Pagini recente » Cod sursa (job #1684463) | Cod sursa (job #961254) | Clasament hgfdg | Cod sursa (job #161152) | Cod sursa (job #767261)
Cod sursa(job #767261)
#include <fstream>
using namespace std;
ifstream fin ("divk.in");
ofstream fout ("divk.out");
int v[50007],m[10][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=2;i<=n;i++)
for (j=2;j<=i;j++)
{
if ( j==2 )
rest=(v[i-1]+v[i])%k;
else
rest=(m[!(i%2)][j-1]+v[i])%k;
if(!rest&&j>=a&&j<=b)
nr++;
m[i%2][j]=rest;
}
fout<<nr;
return 0;
}