Cod sursa(job #1755323)
| Utilizator | Data | 9 septembrie 2016 20:52:24 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int main()
{
int v[500001];
int n;
int k,a,b;
int o;
int count = 0;
int sum = 0;
fin >> n >> k >> a >> b;
for (int i = 0; i < n; i++) {
fin >> v[i];
}
for (int i = 0; i < n; i++) {
o = a;
while (o < b) {
sum = 0;
for (int j = i; j < o; j++) {
sum += v[j];
}
o++;
}
if (sum % 5 == 0) {
count++;
}
}
fout << count;
}
