Cod sursa(job #2100153)
Utilizator | Data | 5 ianuarie 2018 12:18:39 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.5 kb |
#include <fstream>
using namespace std;
ifstream in("divk.in");
ofstream out("divk.out");
int x, n, k, a, b, i, j;
int s[500001];
long long sol, nr1[500001], nr2[500001];
int main()
{
in>> n>>k>>a>>b;
for (i=1; i<=n; i++)
{
in>> x;
s[i]=(s[i-1]+x)%k;
if (i>=a)
{
nr1[s[i-a]]++;
}
if (i > b)
{
nr2[s[i-b-1]]++;
}
sol+=nr1[s[i]]-nr2[s[i]];
}
out<< sol;
return 0;
}