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