Cod sursa(job #3315912)
| Utilizator | Data | 16 octombrie 2025 16:00:55 | |
|---|---|---|---|
| Problema | Divk | Scor | 90 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int sp[500001];
int freq[100001];
int main()
{
int n,k,a,b,x,ans=0;
fin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
fin>>x;
sp[i]=(sp[i-1]+x)%k;
}
for(int i=a;i<=n;i++)
{
freq[sp[i-a]]++;
ans+=freq[sp[i]];
if(i>=b) freq[sp[i-b]]--;
}
fout<<ans;
return 0;
}
