Cod sursa(job #2420782)
Utilizator | Data | 13 mai 2019 12:14:00 | |
---|---|---|---|
Problema | Divk | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream in ("divk.in");
ofstream out("divk.out");
long long f[1000009], v[1000000], k, a, b, i, n, sol;
int main()
{
in >> n >> k >> a >> b;
for ( i=1; i <= n; i++ ){
in>>v[i];
v[i] += v[i-1];
v[i] %= k;
}
for ( i=a; i <= n; i++ ){
f[ v[i-a] ] ++;
if ( i>b ) f[ v[i-b-1] ]--;
sol += f[v[i]];
}
out<<sol;
return 0;
}