Cod sursa(job #590311)
| Utilizator | Data | 16 mai 2011 18:58:12 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
long long v[600001];
long n, k, a, b, t, i, j;
unsigned long long s;
int main()
{
ifstream f ("divk.in");
ofstream g ("divk.out");
f>>n;
f>>k;
f>>a;
f>>b;
t=0;
for (i=1; i<=n; i++) f>>v[i];
for (i=1; i<=n-a; i++)
{
s=0;
for (j=1; j<=a; j++) s+=v[j+i-1];
for (j=1; j<=b-a+1; j++)
{
if (s%k==0) t++;
s+=v[a+i-2+j];
}
}
g<<t;
return 0;
}
