Cod sursa(job #2110825)
| Utilizator | Data | 21 ianuarie 2018 13:42:11 | |
|---|---|---|---|
| Problema | Divk | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int v[500005];
int a, b, n, k, nr;
int main(){
fin >> n >> k >> a >> b;
for(int i = 1; i <= n; i++){
int x;
fin >> x;
v[i] = v[i - 1] + x;
v[i] %= k;
}
for(int i = a; i <= b; i++)
nr += !v[i];
for(int i = a; i <= n; i++){
for(int j = i - a; j > 0 and j >= i - b; j--)
nr += !(v[i] - v[j]);
}
fout << nr;
cout<<nr;
return 0;
}
