infoarena

# include <iostream>
# include <cstring>
using namespace std;

char cuvant[21],inv[21],n;
void invers(int i,int j)
{
    int m = (i+j)/2;
    if( i == j )
    {
        inv[n-i] = cuvant[i];
    }
    else
    {
        invers(i,m);
        invers(m+1,j);
    }
}

main()
{
    cout << "Cuvant:";
    cin.get(cuvant,21);
    n = strlen(cuvant);
    inv[n] = NULL;
    --n;
    invers(0,n);
    cout << inv;
}

void reverse( char* s , int i, int j )
{
  if ( i < j )
  {
    std::swap( s[i], s[j] );
    reverse( s, i+1, j-1 );
  }
}

void reverse( char* s )
{
  if ( ! s )
    return;
  char* e = s;
  while ( *e )
    ++e;
  for ( --e; s < e; ++s, --e )
  {
    char t = *s;
    *s = *e;
    *e = t;
  }
}

#include <string>
// ...
string reverse( string s )
{
  if ( s.size() < 2 )
    return s; // am ajuns la baza
  // subproblema "stanga"
  string l = reverse( s.substr( s.size() / 2, s.size() - 1 ) );
  // subproblema "dreapta"
  string r = reverse( s.substr( 0, s.size() / 2 ) );
  // combinarea celor doua solutii
  string c = l + r;
  return c;
}

algoritm fill(X, Y)
dacă A[X][Y] = 0 atunci
A[X][Y] ← 2
fill(X, Y + 1)
fill(X + 1, Y)
fill(X, Y - 1)
fill(X - 1, Y)
sfârșit dacă
sfârșit algoritm

0 0 0 1 1 0 0
0 0 1 0 0 1 0
0 1 0 1 0 0 1
1 0 0 0 0 1 0
1 0 0 1 1 0 0
0 1 1 0 0 0 0

0 0 0 1 1 0 0
0 0 1 2 2 1 0
0 1 2 1 2 2 1
1 2 2 2 2 1 0
1 2 2 1 1 0 0
0 1 1 0 0 0 0