Cod sursa(job #2522830)
Utilizator | Data | 13 ianuarie 2020 03:10:52 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin ("divk.in");
ofstream fout("divk.out");
int s,a,b,v[10004],v1[10004],n,k,x;
int main ()
{
fin>>n>>k>>a>>b;
for(int i=1;i<=n;i++)
{
fin>>x;
v[i]=(v[i-1]+x)%k;
}
for(int i=a;i<=n;i++)
{
if(i>b)
v1[v[i-b-1]]--;
v1[v[i-a]]++;
s+=v1[v[i]];
}
fout<<s;
return 0;
}