Cod sursa(job #2101519)
Utilizator | Data | 7 ianuarie 2018 17:21:27 | |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
int N,K,A,B,v[5000010],i,cv[100001],nr;
ifstream f("divk.in");
ofstream g("divk.out");
int main()
{
f>>N>>K>>A>>B;
for(i=1;i<=n;i++)
{
f>>V[i];
V[i]=(V[i]+V[i-1])%K;
if(i>B)
{
cv[V[i-B-1]]--;
}
if(i>=A)
{
cv[V[i-A]]++;
}
nr=nr+d[V[i]];
}
g<<nr;
return 0;
}