Cod sursa(job #590036)
Utilizator | Data | 15 mai 2011 09:03:10 | |
---|---|---|---|
Problema | Divk | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include<stdio.h>
#include<fstream.h>
#define N 500001
long long s[N],l=0;
long n,k,a,b,c,i,j;
int main()
{freopen("divk.in","r",stdin);
ofstream f("divk.out");
scanf("%ld%ld%ld%ld",&n,&k,&a,&b);
s[0]=0;
for(i=1;i<=n;i++)
{scanf("%ld",&c);
s[i]=s[i-1]+c;}
for(j=a;j<=b;j++)
{for(i=j;i<=n;i++)
if((s[i]-s[i-j])%k==0)
l++;}
f<<l;
fclose(stdin);
f.close();
return 0;}