// the theorems you have to use:

1. sum


int sum_r(int v[], int n) 	 //  adding up the values in the row of a matrix
{
    int s=0;
    for(int j=0; j<n; ++j)
    {
        s=s+v[j];
     }
    return s;
}


2. counting

int c=0;
for(int i=0; i<n;++i)
{
    if(condition)
    {
        c=c+1;
     }
   
}

3. the maximum of.. max-search

int max_ind=0;
int max_value=v[0];

for(int i=1;i<n;++i)
{
    if (max_value<v[i])
   {
      max_value=v[i];
      max_ind=i;
   }

}

4. conditional max-search

 
 int max_value, ind;
 bool van=false;

  for(int i=0; i<n; ++i)
 {
         if(  not condition) {}

         if(condition  && !van )	//like:  x[0][j]<0 && x[1][j]>0  !
         {
            van=true;
            max_value=v[i];	// or : oszloposszeg(x,j) like in one of the probems...
            ind=i;

         }

        if( condition && van )		//beta - a felt.!
         {
           if(v[i] >max_value)
          {
           max_value=v[i];
           ind=i;
          }

         }

}

5. lin.- search
    
    int ind;

    bool l=false;
    int i=0;
    while(!l && i<n)
    {
        l= condition;   // something like:   (y[i]<0);
        i++;
     }

     if(l)
       ind=i-1;

6. optimistic  lin_search

    bool all_are=true;
    int j=0;
     while ( j<(int)x.size() && all_are)
    {
        all_are=(the condition);   /*  a condition, like:    x[j]==1   */
        ++j;
    }
    return all_are;
}