Cod sursa(job #2123386)
Utilizator | Data | 6 februarie 2018 10:23:30 | |
---|---|---|---|
Problema | Divk | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int n, k, a, b;
unsigned int sp[500002], t;
int main()
{
int i, j, x;
fin>>n>>k>>a>>b;
for(i=1; i<=n; i++)
{
fin>>x;
sp[i]=sp[i-1]+(unsigned int)x;
if(i>=a)
{
for(j=i-a; j>=i-b && j>=0; j--)
if((sp[i]-sp[j])%k==0) t++;
}
}
fout<<t<<'\n';
return 0;
}