Nu aveti permisiuni pentru a descarca fisierul grader_test9.ok
Cod sursa(job #617040)
Utilizator | Data | 13 octombrie 2011 20:36:43 | |
---|---|---|---|
Problema | Divk | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.71 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long long int suma ;
long int min , max , n , i , j , len , sb = 0 , depasit , div ;
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( suma != 0 )
if( len >= min && len <= max && suma % div == 0 )
sb++;
if( len > max )
depasit = 1 ;
}
}
g<<sb;
g.close();
f.close();
return 0;
}