Cod sursa(job #590844)
Utilizator | Data | 20 mai 2011 14:56:39 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include<fstream.h>
#include<iostream.h>
int main ()
{
long v[500100];
long long k,n,a,b,i,j,c,s;
ifstream f("divk.in");
ofstream g("divk.out");
f>>n>>k>>a>>b;
for(i=1;i<=n;i++) f>>v[i];
f.close();
c=0;
for(i=1;i<=n-a+1;i++) {
s=v[i];
for(j=i+1;j<=n;j++) {
s=s+v[j];
if(((j-i+1)>=a)&&(s%k==0)&&((j-i+1)<=b)) c++;
}
}
g<<c;
g.close();
return 0;
}