Pagini recente » Cod sursa (job #670718) | Cod sursa (job #2563476) | Cod sursa (job #1465757) | Cod sursa (job #2583314) | Cod sursa (job #1049372)
#include <stdio.h>
using namespace std;
int main()
{
int n,a,b,k;
freopen("divk.in","r",stdin);
freopen("divk.out","w",stdout);
scanf("%d%d%d%d",&n,&k,&a,&b);
int v[n+1];
int x[n+1][n+1];
for(int i=1;i<=n;i++)
{
scanf("%d",&v[i]);
x[i][i]=v[i];
}int nr=0;
for(int i=2;i<=b;i++)
{
for(int h=1;h<=n-i+1;h++)
{
x[h][h+i-1]=x[h][h]+x[h+1][h+i-1];
if((x[h][h+i-1])%k==0)nr++;
}
}
printf("%d",nr);
return 0;
}