Pagini recente » Cod sursa (job #3317649) | Borderou de evaluare (job #3350521) | Cod sursa (job #3334608) | Cod sursa (job #1016423) | Cod sursa (job #3343366)
#include <iostream>
#include<fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int main()
{ int s[500001], v[500001], k,a,b,n,sum,nr=0,i,j,p;
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
f>>v[i];
s[1]=v[1];
for(i=2;i<=n;i++)
{s[p]=s[p-1]+v[i];
p++; }
for(p=n;p>=1;p++)
for(j=p-1;j>=1;j--)
if((s[p]-s[j])%k==0&&(i-j)<b&&(i-j)>=(a-1))
nr++;
g<<nr;
return 0;
}