Cod sursa(job #2880431)
| Utilizator | Data | 29 martie 2022 18:50:03 | |
|---|---|---|---|
| Problema | Divk | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include<bits/stdc++.h>
#define int long long
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int v[500002],s[500002];
signed main()
{
int k,a,b,i,n,contor=0,j;
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
f>>v[i];
s[i]=s[i-1]+v[i];
}
for(i=1;i<=n;i++)
{
for(j=i+a-1;j<=i+b-1 && j<=n;j++)
{
if((s[j]-s[i-1])%k==0)
contor++;
}
}
g<<contor;
return 0;
}
