Cod sursa(job #2557147)
| Utilizator | Data | 25 februarie 2020 16:11:53 | |
|---|---|---|---|
| Problema | Divk | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.53 kb |
#include<bits/stdc++.h>
#define Nmax 500005
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int n, a, b ,k;
long long sol;
int v[Nmax];
int dp[100001];
int main()
{
f >> n >> k >> a >> b;
for(int i = 1 ; i <= n ; ++i)
f >> v[ i ];
for(int i = 1 ; i <= n ; ++i)
{
v[ i ] = (v[ i ] + v[ i - 1 ]) % k;
if( i >= a)
dp[v[i-a]]++;
if( i > b)
dp[v[i-b-1] ] --;
sol += dp[v[i]];
}
g << sol;
return 0;
}
