Cod sursa(job #3207481)
Utilizator | Popescu David david333 | Data | 26 februarie 2024 11:30:29 |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.76 kb |
#include <fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
int n,k,a,b,st,dr,v[500005],s[500005],sum,i,j,nr,lmax,l;
int main()
{
cin>>n>>k>>a>>b;
for(i=1; i<=n; i++)
{
cin>>v[i];
s[i]=s[i-1]+v[i];
}
lmax=b;
i=1; j=2;
while(i<n&&j<=n)
{
sum=s[j]-s[i-1];
if(sum%k==0&&i!=j)
{
j++;
l++;
nr++;
}
else
{
j++;
l=0;
}
if(l==lmax)
{
i++;
j=i+1;
l=0;
}
if(j==n)
{
i++;
j=i+1;
l=0;
}
}
cout<<nr;
return 0;
}