Cod sursa(job #2500508)
| Utilizator | Data | 28 noiembrie 2019 09:28:12 | |
|---|---|---|---|
| Problema | Divk | Scor | 30 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
long long v[500005],s[500005],k,a,b,n,cnt;
int main()
{
cin>>n>>k>>a>>b;
for(int i=1;i<=n;i++){
cin>>v[i];
s[i]=s[i-1]+v[i];
}
for(int i=1;i<=n;i++){
for(int j=i+a-1;j<i+b;j++){
if((s[j]-s[i-1])%k==0 && j<=n){
cnt++;
}
}
}
cout<<cnt;
return 0;
}
