h3. the binary search tree.

== code(c) |
Ford-Fulkerson(c, f)
      f[i][j]=0 pt i,j=1,n
      cat timp exista un drum de ameliorare p executa
          mareste fluxul f de-a lungul drumului p
      returneaza f
==
 
 
// Sorting Big Numbers using Trie-Forest based sort indexed in a STL set (Red-Black Tree)
// copyright   idea :          Serban Lupulescu
//             implementation: Mircea Dima
// Time Complexity: O(n*max_len)
// Faculty of Mathematics and Computer Science, University of Bucharest
// :D

== code(c) |
#include <cstdio>

#define maxh 666013
#define N 10024

// Sorting Big Numbers using Trie-Forest based sort indexed in a STL set (Red-Black Tree)
// copyright   idea :          Serban Lupulescu
//             implementation: Mircea Dima
// Time Complexity: O(n*max_len)
// Faculty of Mathematics and Computer Science, University of Bucharest
// :D
 

using namespace std;
inline int length(char a[])