Cod sursa(job #732843)
| Utilizator | Data | 11 aprilie 2012 08:50:05 | |
|---|---|---|---|
| Problema | Divk | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.4 kb |
#include<fstream>
using namespace std;
int n,k,a,b,i,s,v1[500010],v2[500010],v3[500010];
int main ()
{
ifstream fin("divk.in");
ofstream fout("divk.out");
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
fin>>v1[i];
for(i=1;i<=n;i++)
v2[i]=(v2[i-1]+v1[i])%k;
for(i=1;i<=n;i++)
{
if(i-a>=0)
++v3[v2[i-a]];
if(i-b>0)
--v3[v2[i-b-1]];
s=s+v3[v2[i]];
}
fout<<s;
return 0;
}