Cod sursa(job #1574978)
Utilizator | Data | 20 ianuarie 2016 23:14:20 | |
---|---|---|---|
Problema | Divk | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<fstream>
#define NMax 500005
#define KMax 100005
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
long long Sol;
int N,K,A,B;
int S[NMax],R[KMax];
int main()
{
fin>>N>>K>>A>>B;
for(int i=1;i<=N;++i)
{
fin>>S[i];
S[i]=(S[i]+S[i-1])%K;
if(i>=A) ++R[S[i-A]];
if(i>B) --R[S[i-B-1]];
Sol+=R[S[i]];
}
fout<<Sol<<"\n";
fin.close();
fout.close();
return 0;
}