Cod sursa(job #3202823)
Utilizator | Data | 12 februarie 2024 12:34:50 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.45 kb |
#include <fstream>
using namespace std;
ifstream fin ("divk.in");
ofstream fout("divk.out");
int n,i,S[500003],k,a,b,D[500003];
int main()
{
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
fin>>x;
S[i]=(S[i-1]+x)%k;
}
for(i=1;i<=n;i++)
{
if(i>=a)
D[V[i-a]]++;
sol+=D[V[i]];
if(i>=b)
D[V[i-b]]--;
}
fout<<sol;
return 0;
}
/*
0 2 1 1 0 1 0
*/