Cod sursa(job #668715)
Utilizator | Data | 25 ianuarie 2012 15:39:34 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.39 kb |
#include <fstream>
using namespace std;
int s[500001],fr[100001];
int main()
{
ifstream f("divk.in");
ofstream h("divk.out");
int n,a,i,nr=0,A,b,k;
f>>k>>n>>a>>b;
fr[0]=1;
for(i=1;i<=k;i++){
f>>A;
s[i]=(s[i-1]+A)%n;
if(i>=a)fr[s[i-a]]++;
if(i>b)fr[s[i-b-1]]--;
nr+=fr[s[i]];
}
h<<nr;
return 0;
}