Cod sursa(job #565555)
| Utilizator | Data | 27 martie 2011 21:48:43 | |
|---|---|---|---|
| Problema | Divk | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.38 kb |
#include<fstream.h>
#define N 500001
long c[N],n,k,a,b,i,j;
long long s[N],l=0;
int main()
{ifstream f1("divk.in");
ofstream f2("divk.out");
f1>>n>>k>>a>>b;
s[0]=0;
for(i=1;i<=n;i++)
{f1>>c[i];
s[i]=s[i-1]+c[i];}
for(j=a;j<=b;j++)
{for(i=0;i<=n-j;i++)
if((s[i+j]-s[i])%k==0)
l++;}
f2<<l;
f1.close();
f2.close();
return 0;}
