Cod sursă (job #95726)

//Iisuse miluieste -ma
#include<fstream>
#define GOD 5000000
using namespace std;

void GOD_sort( long int a[ ] , long  int n )
{
long int p , aux , gasit;
do {
    gasit = 0 ;
    for( p = 0 ; p < n; p ++ )
       {
      if( a[ p ] > a[ p + 1 ] )
        {
        aux = a[ p ];
        a[ p ] = a[ p + 1];
	a[ p + 1] = aux;
	gasit = 1;
 	}
      }
  }while( gasit );
}
int main()
{
long int l[ GOD ] , x , d , k , i , j , N , h , suma = 0;
//Iisuse miluieste - ma 
ifstream f("lalele.in");
ofstream g("lalele.out");
f>>N;
f>>d;
f>>x;
suma = suma + d;
i = 0;
while( suma <= N )
     {
         if( x )
      	   {
 	   while( d )
  		{
  		 l[ i ] = x;
		 for( j = 0; j <= i ; j ++ )
   		     l[ j ] ++;
		i ++;
		d --;
		}
	  }
       if ( !x )
  	  {
           k = i;
	   GOD_sort ( l , ( k - 2 ) );
	   while ( d > 0 )
                {
                  k = k / 2;
	          g<<l[ k ]<<endl;
		  d --;
		  for ( h = 0; h < k ; h ++ )
		       l [ h ] ++;
                  }
            i = k;
	    }
        if( !f.eof () )
           {
           f>>d;
           f>>x;
           suma = suma + d;
            } 
      }
f.close();
g.close();
return 0;
}