Cod sursa(job #3207487)
Utilizator | Data | 26 februarie 2024 11:40:45 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
long long a,b,i,s[500005],n,k,x,j,vf[500005],nr;
int main()
{
fin>>n>>k>>a>>b;
for (i=1; i<=n; i++)
{
fin>>x;
s[i]=(s[i-1]+x)%k;
sum=0;
for (j=1;j<=n;j++)
{
if (j>=a)
{
vf[s[j-a]]++;
}
nr+=vf[s[j]];
if (j>=b) vf[s[j-b]]--;
}
fout<<nr;
return 0;
}