Cod sursa(job #2053148)
Utilizator | Data | 31 octombrie 2017 15:52:52 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
int ap[100005],n,k,a,b,v[500005];
long long s;
int main()
{
cin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
cin>>v[i];
v[i]=(v[i-1]+v[i])%k;
if(i>=a)
ap[v[i-a]]++;
if(i>b)
ap[v[i-b-1]]--;
s+=ap[v[i]];
}
cout<<s;
return 0;
}