Cod sursa(job #2447780)
| Utilizator | Data | 14 august 2019 15:55:29 | |
|---|---|---|---|
| Problema | Divk | Scor | 10 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
#define nmax 500001
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int main(){
int n, k, a, b, x;
long long sums[nmax]={0};
int i, j;
long long nrsecv=0;
f>>n>>k>>a>>b;
for(i=1;i<=n;i++){
f>>x;
sums[i]=(sums[i-1]+x)%k;
}
j=0;
i=b;
while(i<=n){
while((i-j)>=a){
if((sums[i]-sums[j])%k==0){
nrsecv++;
}
j++;
}
i++;
j=i-b;
}
g<<nrsecv<<"\n";
}