Cod sursa(job #1600546)
Utilizator | Lungu Ioan Adrian metrix007 | Data | 15 februarie 2016 09:44:59 |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.65 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 j=1;j<=n;j++)
{
for(int i=1;i<=j;i++)
{
sum = s[j] - s[i-1];
if(sum%k==0 && (j-i+1)>=a && (j-i+1)<=b)
{
// cout << i << " " << j << endl;
nr++;
}
}
}
out << nr;
return 0;
}