Pagini recente » Cod sursa (job #715240) | Cod sursa (job #2638819) | Istoria paginii tygyn/solutie_romana | Cod sursa (job #28035) | Cod sursa (job #2177291)
#include <fstream>
#define NM 100002
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
unsigned long long n,k,A,B,i,j,nr,a;
unsigned long long x[NM*5];
int main()
{
f>>n>>k>>A>>B;
for(i=1;i<=n;i++)
{ f>>a; x[i]=a%k+x[i-1]; }
nr=0;
for(i=A;i<=n;i++){
for(j=A;j<=B&&i-j+1>0;j++)
if((x[i]-x[i-j])%k==0) nr++;
}
g<<nr<<'\n';
return 0;
}