Pagini recente » Cod sursa (job #1023065) | Cod sursa (job #193794) | Cod sursa (job #2461196) | Cod sursa (job #1130374) | Cod sursa (job #617026)
Cod sursa(job #617026)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long int n , div , suma , min , max , i , j , len , sb = 0 , depasit ;
long long int v[10000];
fstream f("divk.in",ios::in);
fstream g("divk.out",ios::out);
f>>n ;
f>>div ;
f>>min ;
f>> max;
for(i = 0 ; i < n ; i++)
f>>v[i];
for( i = 0 ; i < n - 1 ; i++ )
{
suma = v[i];
len = 1;
depasit = 0 ;
for( j = i + 1 ; j < n && !depasit ; j++ )
{
suma += v[j];
len++;
if( len >= min && len <= max && suma % div == 0 )
sb++;
if( len > max )
depasit = 1 ;
}
}
g<<sb;
return 0;
}