Cod sursa(job #761547)
| Utilizator | Data | 26 iunie 2012 14:40:18 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int n, i, v[500010], r[100010], k, a, b;
long long rez;
int main()
{
ifstream fin("divk.in");
ofstream fout("divk.out");
fin >> n >> k >> a >> b;
for(i = 1; i <= n; i++)
{
fin >> v[i];
v[i] = (v[i] + v[i - 1]) % k;
}
for(i = 1; i <= n; i++)
{
if (i - a >= 0) r[v[i - a]]++;
rez += r[v[i]];
if (i - b >= 0) r[v[i - b]]--;
}
fout << rez;
return 0;
}
