Cod sursa(job #758035)
| Utilizator |  zzz zzz misino |
Data | 14 iunie 2012 10:31:27 |
|---|---|---|---|
| Problema | Divk | Scor | 90 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.31 kb |
#include<fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int a1,b,k,n,s,i,v[500201],a[500201];
int main()
{f>>n>>k>>a1>>b;
for(i=1;i<=n;++i)
{f>>v[i];
v[i]=(v[i-1]+v[i])%k;
}
for(i=a1;i<=n;++i)
{a[v[i-a1]]++;
if(i>b)
a[v[i-b-1]]--;
s+=a[v[i]];
}
g<<s<<'\n';
return 0;
} 