Pagini recente » Cod sursa (job #2579433) | Cod sursa (job #1537648) | Cod sursa (job #2025659) | Cod sursa (job #1928769) | Cod sursa (job #2173617)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int K , A , B , N , T , i , j , t , v[100000] , s;
ifstream f("divk.in");
ofstream g("divk.out");
f>>N>>K>>A>>B;
T=0;
for(i=0;i<N;i++)
f>>v[i];
for(i=0;i<N;i++)
{
s=0;
for(j=i;j<N;j++)
{
{
if(j-i+1>=A&&j-i+1<=B)
s=s+v[j];
else
break;
}
}
if(s%K==0&&s!=0)
T++;
}
g<<T;
f.close();
g.close();
return 0;
}