Cod sursa(job #3202802)
Utilizator | Denis Voc Denis_Voc | Data | 12 februarie 2024 11:44:56 |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
using namespace std;
int n,k,a,b,v,s[500001],fr[500001];
long long cnt=0;
int main()
{
ifstream fin("sumainsecv.in");
ofstream fout("sumainsecv.out");
fin>>n>>k>>a>>b;
s[0]=0;
for(int i=1; i<=n; i++)
{
fin>>v;
s[i] = (s[i-1] + v)%k;
}
for(int i=1;i<=n;i++)
{
if(i>=a)
{
fr[s[i-a]]++;
}
cnt+=fr[s[i]];
if(i>=b)
{
fr[s[i-b]]--;
}
}
fout<<cnt;
return 0;
}