Pagini recente » Cod sursa (job #307663) | Cod sursa (job #2780220) | Cod sursa (job #1705980) | Cod sursa (job #1456709) | Cod sursa (job #2161496)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("divk.in");
ofstream g("divk.out");
int divk(int w[100], int k, int a, int b)
{int i,j,m,numar=0,evid=0;
for(i=a;i<=b-1;i++)
{
for(j=a+1;j<=b;j++)
{
for(m=i;m<=j;m++)
numar=numar+w[m];
}
if(numar%k==0) evid++;
}
return evid;
}
int w[100],k,a,b,i,n;
int main()
{
f>>n>>k>>a>>b;
for(i=1;i<=n;i++)
f>>w[i];
g<<divk(w,k,a,b);
return 0;
}