Pagini recente » Cod sursa (job #816718) | Cod sursa (job #53645) | Cod sursa (job #1049619) | Cod sursa (job #1740852) | Cod sursa (job #2788914)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
ifstream fin("divk.in");
ofstream fout("divk.out");
int main()
{
int N, K, A, B, v[101];
int T=0;
fin>>N>>K>>A>>B;
for(int i=1;i<=N;i++)
fin>>v[i];
for(int i=1;i<N;i++)
{
for(int l=1;l+i<=N;l++)
{
int sum=0;
for(int j=i;j<=i+l;j++)
sum+=v[j];
if((l+1>=A && l+1<=B)&&(sum%K==0))
T++;
}
}
fout<<T;
return 0;
}