Cod sursa(job #2555553)
Utilizator | Data | 24 februarie 2020 09:45:24 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <fstream>
using namespace std;
long long marcel,sum[500005],v[500005];
int a,b,n,k,x,i;
int main()
{
ifstream fin("divk.in");
ofstream fout("divk.out");
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++)
{
fin>>x;
sum[i]=(sum[i-1]+x)%k;
if(i>=a)
v[sum[i-a]]++;
if(i>b)
v[sum[i-b-1]]--;
marcel+=1LL*v[sum[i]];
}
fout<<marcel<<"\n";
return 0;
}