Cod sursa(job #1040166)
Utilizator | Data | 24 noiembrie 2013 00:27:01 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main() {
int i,j,n,k,a,b,v[500001],l,s=0,nr=0;
ifstream f("divk.in");
f>>n>>k>>a>>b;
for (i=0;i<n;i++)
f>>v[i];
f.close();
for (i=a;i<=b;i++) {
l = i;
while (l<=n) {
for (j=l-i;j<l;j++)
s += v[j];
if (s%k==0)
nr++;
s = 0;
l++;
}
}
ofstream g("divk.out");
g<<nr;
return 0;
}