Cod sursa(job #1461283)
Utilizator | Data | 15 iulie 2015 12:25:31 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.46 kb |
#include<fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int v[500005],st[100005];
int n,k,a,b,i;
long long sol;
int main(){
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++){
fin>>v[i];
v[i]=v[i]+v[i-1];
v[i]=v[i]%k;
}
for(i=a;i<=n;i++){
st[ v[i-a] ] ++;
if(i>b){
st[ v[i-b-1] ] --;
}
sol+=st[v[i]];
}
fout<<sol<<"\n";
return 0;
}