Cod sursa(job #2454108)
Utilizator | Data | 7 septembrie 2019 14:21:37 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.43 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("divk.in");
ofstream out("divk.out");
long long sum[500001],rest[100000];
long long n,k,a,b,i,ok=0,x;
int main()
{
in>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
in>>x;
sum[i]=(sum[i-1]+x)%k;
if(i>=a)++rest[sum[i-a]];
if(i>b)--rest[sum[i-b-1]];
ok=ok+rest[sum[i]];
}
out<<ok;
return 0;
}