Cod sursa(job #1749822)
Utilizator | Data | 28 august 2016 20:10:27 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
long long s[500005],v[500005],r;
int a,b,n,k,x;
int main()
{
int i;
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
f>>x;
s[i]=(s[i-1]+x)%k;
if(i>=a)
v[s[i-a]]++;
if(i>b)
v[s[i-b-1]]--;
r=r+(1LL*v[s[i]]);
}
g<<r<<"\n";
return 0;
}