Pagini recente » Cod sursa (job #1466502) | Cod sursa (job #1759473) | Cod sursa (job #1669180) | Cod sursa (job #2727961) | Cod sursa (job #1471420)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int n,i,j,a,b,k,nr,sec=0,r[500000],s,sw;
ifstream f("divk.in");
ofstream g("divk.out");
f>>n;f>>k;f>>a;f>>b;
for(i=1;i<=n;i++)
{
f>>r[i];
}
for(i=1;i<n;i++)
{
nr=1;
sw=1;
s=r[i];
j=i+1;
while((j<=n)&&(sw==1))
{
nr++;
s=s+r[j];
if((nr>=a)&&(nr<=b))
{
if(s%k==0)
{
sec++;
}
}
else
{
if(nr>b)
{
sw=0;
}
}
j++;
}
}
g<<sec;
return 0;
}