Cod sursa(job #627099)
Utilizator | Data | 28 octombrie 2011 23:48:46 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
long int n,a,b,k,v[500002],i,i2,i3,nr,s;
int main() {
f>>n>>k>>a>>b;
for (i=1;i<=n;i++) f>>v[i];
for (i=1;i<=n;i++) for (i2=a;i2<=b;i2++) {
s=0;
for (i3=i;i3<=i+i2;i3++) {
if (i3<=n) s=s+v[i3];
else break;
}
if (s%k==0) nr++;
}
nr--;
g<<nr;
return 0;
}