Cod sursa(job #1042919)
Utilizator | Data | 27 noiembrie 2013 19:49:10 | |
---|---|---|---|
Problema | Divk | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int s, x,a,b,n,k,i,v[500002],uz[100002];
int main(){
f>>n>>k>>a>>b;
for(i=1;i<=n;i++){
f>>x;
v[i]=(v[i-1]+x)%k;}
for(i=a;i<=n;i++){
uz[v[i-a]]++;
if(i>b)
uz[v[i-b-1]]--;
s+=uz[v[i]];}
g<<s<<'\n';
return 0;
}