Cod sursa(job #2487869)
Utilizator | Ionescu Emanuel emanuel27i | Data | 5 noiembrie 2019 20:15:51 |
---|---|---|---|
Problema | Divk | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.73 kb |
#include <fstream>
#include <deque>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
deque <int> v;
long long x,a,b,s;
int main()
{
long long n,k=0,m;
fin>>n>>x>>a>>b;
for(int i=0;i<n;i++)
{
fin>>m;
if(v.size()<b)
{
v.push_back(m);
s+=m;
if(s%x==0)
k++;
}
if(v.size()==b||i==n-1)
{
int g=v.size();
while(g>=a)
{
if(s%x==0)
k++;
s-=v.front();
v.pop_front();
g--;
}
}
}
fout<<k;
}