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