Cod sursa(job #1721641)
Utilizator | Data | 26 iunie 2016 10:34:54 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <stdio.h>
using namespace std;
int n,k,a,b;
long long int sum[100005];
int main()
{
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%d%d%d%d",&n,&k,&a,&b);
long long int rasp=0;
for(int i=1;i<=n;i++) {
scanf("%d",sum[i]);
sum[i]+=sum[i-1];
for(int j=max(1,i-b);j<=max(1,i-a);j++)
if((sum[i]-sum[j])%k==0)
rasp++;
}
fout<<rasp;
return 0;
}