Cod sursa(job #2303346)
Utilizator | Data | 16 decembrie 2018 02:36:39 | |
---|---|---|---|
Problema | Divk | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int n,k,a,b,i,j,x[500001],rez,nr;
int rest[500001];
int main()
{
fin>>n>>k>>a>>b;
for(i=1;i<=n;i++){
fin>>nr;
x[i]=(nr+x[i-1])%k;
if(i>=a)
rest[x[i-a]]++;
if(i-b>=1)
rest[x[i-b-1]]--;
rez+=rest[x[i]];
}
fout<<rez;
}