Cod sursa(job #2233032)
Utilizator | Data | 21 august 2018 22:35:05 | |
---|---|---|---|
Problema | Divk | Scor | 40 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
int n,k,a,b,v[500010],ans;
int main()
{
ifstream cin("divk.in");
ofstream cout("divk.out");
cin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
cin>>v[i];
v[i]+=v[i-1];
}
for(int i=a;i<=b;i++)
for(int j=i;j<=n;j++)
{
if(!((v[j]-v[j-i])%k)) ans++;
}
cout<<ans;
return 0;
}