Pagini recente » Cod sursa (job #1484457) | Cod sursa (job #1841217) | Cod sursa (job #2665319) | Cod sursa (job #2680278) | Cod sursa (job #1652209)
#include <iostream>
#include <fstream>
using namespace std;
long long s[500001];
int main()
{int i,j,n,k,a,b,x;
long long nr=0;
fstream f("divk.in",ios::in);
fstream g("divk.out",ios::out);
f>>n>>k>>a>>b;
f>>s[1];
for(i=2;i<=n;i++)
{f>>x;
s[i]=s[i-1]+x;
if(s[i]%k==0 && i>=a && i<=b)
nr++;
}
for(i=n;i>a;i--)
for(j=i-a;(j>=i-b && j>0);j--)
if((s[i]-s[j])%k==0)
nr++;
g<<nr;
}