Cod sursa(job #892462)
| Utilizator | Data | 26 februarie 2013 09:50:42 | |
|---|---|---|---|
| Problema | Divk | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream cin("divk.in");
ofstream cout("divk.out");
long long N, K, A, B, s,i,x;
long long V[500010], asd[100010];
int main ()
{
cin>>N>>K>>A>>B;
for (i=1;i<=N;i++)
{ cin>>x;
V[i]=(V[i-1]+x)%K;}
for (i=1;i<=N;i++)
{
if(i-A>=0)
++asd[V[i-A]];
else
--asd[V[i-B]];
s+=asd[V[i]];
}
cout<<s;
return 0;
}
