Cod sursa(job #3202772)
Utilizator | Georg Popescu ThomasP | Data | 12 februarie 2024 11:30:14 |
---|---|---|---|
Problema | Divk | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("divk.in");
ofstream out("divk.out");
int v[500001];
int f[10000001];
int main()
{
int n,k,a,b;
in>>n>>k>>a>>b;
for(int i=1;i<=n;i++){
in>>v[i];
}
for(int i=1;i<=n;i++){
v[i]= ( v[i] + v[i-1] ) % k;
}
int cnt=0;
for(int i=1;i<=n;i++){
if(i>=a){
f[v[i-a]]++;
}
cnt += f[ v[i] ];
if(i>=b){
f[ v[i-b] ]--;
}
}
out<<cnt;
return 0;
}