Cod sursa(job #1600531)
Utilizator | Data | 15 februarie 2016 09:32:39 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#define NMAX 500002
using namespace std;
ifstream in("divk.in");
ofstream out("divk.out");
int n,a,b,k,v[NMAX],s[NMAX],sum,nr;
int main()
{
in >> n >> k >> a >> b;
for(int i=1;i<=n;i++)
in >> v[i];
for(int i=1;i<=n;i++)
s[i] = s[i-1] + v[i];
for(int i=1;i<=n;i++)
{
for(int j=0;j<i;j++)
{
sum = s[i] - s[j];
if(sum%k==0 && (i-j+1)>=a && (i-j+1)<=b)
nr++;
}
}
out << nr;
return 0;
}